The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A245336

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A245336

Sum of digits of n written in fractional base 8/7.
(history; published version)

#11 by Alois P. Heinz at Mon Mar 16 16:31:16 EDT 2020

STATUS

proposed

approved

#10 by F. Chapoton at Mon Mar 16 16:30:17 EDT 2020

STATUS

editing

proposed

#9 by F. Chapoton at Mon Mar 16 16:30:11 EDT 2020

PROG

(Sage) # uses [basepqsum from A245355]

def base87sum(n):

....L=[n]

....i=1

....while L[i-1]>7:

........x=L[i-1]

........L[i-1]=x.mod(8)

........L.append(7*floor(x/8))

........i+=1

....return sum(L)

[base87sumbasepqsum(8, 7, w) for w in [0..200]]

STATUS

approved

editing

Discussion

Mon Mar 16

16:30

F. Chapoton: factor out the code

#8 by N. J. A. Sloane at Fri Jul 18 18:04:44 EDT 2014

STATUS

proposed

approved

#7 by Hailey R. Olafson at Fri Jul 18 16:54:35 EDT 2014

STATUS

editing

proposed

#6 by Tom Edgar at Fri Jul 18 16:25:26 EDT 2014

STATUS

proposed

editing

#5 by Tom Edgar at Fri Jul 18 14:51:43 EDT 2014

STATUS

editing

proposed

#4 by Tom Edgar at Fri Jul 18 14:51:40 EDT 2014

CROSSREFS

Cf. A053829, A007953, A024649, A000120, A244040.

STATUS

proposed

editing

#3 by Hailey R. Olafson at Fri Jul 18 14:50:27 EDT 2014

STATUS

editing

proposed

#2 by Hailey R. Olafson at Fri Jul 18 14:49:00 EDT 2014

NAME

allocated for Hailey R. Olafson

Sum of digits of n written in fractional base 8/7.

DATA

0, 1, 2, 3, 4, 5, 6, 7, 7, 8, 9, 10, 11, 12, 13, 14, 13, 14, 15, 16, 17, 18, 19, 20, 18, 19, 20, 21, 22, 23, 24, 25, 22, 23, 24, 25, 26, 27, 28, 29, 25, 26, 27, 28, 29, 30, 31, 32, 27, 28, 29, 30, 31, 32, 33, 34, 28, 29, 30, 31, 32, 33, 34, 35, 28, 29, 30, 31

OFFSET

0,3

COMMENTS

The base 8/7 expansion is unique and thus the sum of digits function is well-defined.

FORMULA

a(n) = A007953(A024649(n)).

EXAMPLE

In base 8/7 the number 14 is represented by 76 and so a(14) = 7 + 6 = 13.

PROG

(Sage)

def base87sum(n):

....L=[n]

....i=1

....while L[i-1]>7:

........x=L[i-1]

........L[i-1]=x.mod(8)

........L.append(7*floor(x/8))

........i+=1

....return sum(L)

[base87sum(w) for w in [0..200]]

CROSSREFS

A053829, A007953, A024649, A000120, A244040

KEYWORD

allocated

nonn,base

AUTHOR

Hailey R. Olafson, Jul 18 2014

STATUS

approved

editing