|
|
A289335
|
|
a(n) is the sum of the base-b representations of n for 2 <= b <= n+1 read in base ten.
|
|
1
|
|
|
0, 1, 12, 24, 125, 139, 169, 185, 1096, 1191, 1223, 1243, 1369, 1391, 1425, 1461, 10442, 10468, 10585, 10613, 10741, 10781, 10819, 10851, 11789, 11878, 11918, 12732, 12862, 12900, 12958, 12998, 101989, 102037, 102081, 102133, 102384, 102430, 102476, 102528, 103468, 103518, 103576
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
Since the evaluation of n begins with base 2, the members of this sequence occupy neighborhoods in groups the size of powers of two.
|
|
LINKS
|
|
|
EXAMPLE
|
a(5) = 139 because 5 in bases 2 through 6 is 101, 12, 11, 10 and 5, respectively, and (read as base-10 numbers) their sum is 139.
|
|
MAPLE
|
f:= proc(n) local b, t, L;
t:= 0;
for b from 2 to n+1 do
L:= convert(n, base, b);
t:= t + add(L[i]*10^(i-1), i=1..nops(L));
od:
t
end proc:
|
|
MATHEMATICA
|
f[n_] := Sum[ FromDigits[ IntegerDigits[n, i]], {i, 2, n + 1}]; Array[f, 40, 0]
|
|
PROG
|
(PARI) a(n) = sum(k=2, n+1, fromdigits(digits(n, k), 10)); \\ Michel Marcus, Jul 02 2017
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|