|
|
A043306
|
|
Sum of all digits in all base-b representations for n, for 2 <= b <= n.
|
|
9
|
|
|
1, 3, 4, 8, 10, 16, 17, 21, 25, 35, 34, 46, 52, 60, 58, 74, 73, 91, 92, 104, 114, 136, 128, 144, 156, 168, 171, 199, 193, 223, 221, 241, 257, 281, 261, 297, 315, 339, 333, 373, 367, 409, 416, 430, 452, 498, 472, 508, 515, 547, 556, 608, 598, 638, 634, 670, 698, 756, 717, 777
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,2
|
|
LINKS
|
|
|
FORMULA
|
a(n) = (n-1)*n - Sum_{i=2..n} (i-1)*Sum_{r>=1} floor(n/i^r).
a(n) <= (n-1)^2*log(n+1)/log(n).
Problem: find a better upper estimate. (End)
a(n) ~ (1-Pi^2/12)*n^2 + O(n^(3/2)) (Fissum, 2020). (End)
|
|
EXAMPLE
|
5 = 101_2 = 12_3 = 11_4 = 10_5. Thus a(5) = 2 + 3 + 2 + 1 = 8.
|
|
MATHEMATICA
|
Table[Sum[Total[First[RealDigits[n, i]]], {i, 2, n}], {n, 2, 80}] (* Carl Najafi, Aug 16 2011 *)
|
|
PROG
|
(PARI) a(n) = sum(i=2, n, vecsum(digits(n, i))); \\ Michel Marcus, Jan 03 2017
(PARI) a(n) = sum(b=2, n, sumdigits(n, b)); \\ Michel Marcus, Aug 18 2017
(Python)
from sympy.ntheory.digits import digits
def a(n): return sum(sum(digits(n, b)[1:]) for b in range(2, n+1))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|