|
|
A105351
|
|
Number of divisors of 135...(2n-1), the concatenation of the first n odd numbers.
|
|
1
|
|
|
1, 2, 8, 4, 4, 16, 4, 32, 20, 2, 16, 12, 12, 4, 24, 2, 32, 64, 128, 16, 96, 32, 16, 64, 32, 4, 32, 32, 16, 96, 32, 8, 256, 2, 16, 60, 8, 32, 12, 64, 48, 480, 32, 128, 512, 16, 128, 192, 2, 128, 96, 32, 64, 160, 64, 16, 6, 64, 64
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
EXAMPLE
|
The number of divisors of 13 is 2, hence a(2) = 2.
The number of divisors of 135 is 8, hence a(3) = 8.
The number of divisors of 1357 is 4, hence a(4) = 4.
|
|
MAPLE
|
R:= 1: x:= 1:
for n from 2 to 49 do
x:= x*10^(1+ilog10(2*n-1)) + 2*n - 1;
R:= R, numtheory:-tau(x);
od:
|
|
MATHEMATICA
|
ParallelTable[Divisors[FromDigits[Join@@IntegerDigits/@Table[1+2*k, {k, 0, n}]]]//Length, {n, 0, 48}] (* J.W.L. (Jan) Eerland, Mar 02 2023 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|