|
Search: id:A056795
|
|
|
| A056795 |
|
Number of divisors of k as k runs through sequence of distinct values of LCM[1,..,n]. |
|
+0
1
|
|
| 1, 2, 4, 6, 12, 24, 32, 48, 96, 192, 240, 480, 960, 1920, 2880, 3840, 7680, 15360, 18432, 36864, 73728, 147456, 294912, 442368, 884736, 1769472, 3538944, 4128768, 8257536, 16515072, 33030144, 66060288, 82575360, 165150720, 330301440
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Values of LCM-s in A003418 and accordingly their number of divisors jump at powers of primes(A000961). Here divisor-numbers of LCM-s are displayed without repetition.
|
|
FORMULA
|
a(n)=A000005(A051451(n))
|
|
EXAMPLE
|
For x=19,20,21,22 the value of A003418(x)= A051451(13)=LCM[1,..x]=232792560,of which the number of all divisors is 960, so a(13)=960.
|
|
CROSSREFS
|
A000005, A003418, A051451, A000961.
Sequence in context: A097212 A126098 A018894 this_sequence A094348 A002182 A077006
Adjacent sequences: A056792 A056793 A056794 this_sequence A056796 A056797 A056798
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Aug 28 2000
|
|
|
Search completed in 0.002 seconds
|
