OFFSET
0,3
COMMENTS
LINKS
D. Broadhurst, Primes from concatenation: results and heuristics, NmbrThry List, August 1, 2015
FORMULA
For n < b = 9, we have a(n) = A_b(n) = R(b,n)^2, where R(b,n) = (b^n-1)/(b-1) are the base-b repunits.
EXAMPLE
a(0) = 0 is the result of the empty sum corresponding to 0 digits.
a(2) = 100 = (9+1)^2 = 9^2 + 2*9 + 1 = 121_9, concatenation of (1, 2, 1).
a(10) = 1234567810111087654321_9 is the concatenation of (1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 10, 8, 7, 6, 5, 4, 3, 2, 1), where the middle "10, 11, 10" are the base-9 representations of 9, 10, 9.
PROG
(PARI) a(n, b=9)=sum(i=1, #n=concat(vector(n*2-1, k, digits(min(k, n*2-k), b))), n[i]*b^(#n-i))
CROSSREFS
KEYWORD
nonn,base
AUTHOR
M. F. Hasler, Aug 01 2015
STATUS
approved
