|
Search: id:A008479
|
|
|
| A008479 |
|
Number of numbers <= n with same prime factors as n. |
|
+0
7
|
|
| 1, 1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 2, 1, 1, 1, 4, 1, 3, 1, 2, 1, 1, 1, 4, 2, 1, 3, 2, 1, 1, 1, 5, 1, 1, 1, 5, 1, 1, 1, 3, 1, 1, 1, 2, 2, 1, 1, 6, 2, 4, 1, 2, 1, 7, 1, 3, 1, 1, 1, 2, 1, 1, 2, 6, 1, 1, 1, 2, 1, 1, 1, 8, 1, 1, 3, 2, 1, 1, 1, 5, 4, 1, 1, 2, 1, 1, 1, 3, 1, 3, 1, 2, 1, 1, 1, 9
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
REFERENCES
|
Problem 5735, Amer. Math. Monthly, 78 (1971), 680-681. (Incorrect!)
Problem 5735, Amer. Math. Monthly, 97 (1990), 937.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..10000
|
|
MATHEMATICA
|
PkTbl=Prepend[ Array[ Times @@ First[ Transpose[ FactorInteger[ # ] ] ]&, 100, 2 ], 1 ]; 1+Array[ Count[ Take[ PkTbl, #-1 ], PkTbl[ [ # ] ] ]&, Length[ PkTbl ] ]
|
|
CROSSREFS
|
Cf. A005361, A007947.
Adjacent sequences: A008476 A008477 A008478 this_sequence A008480 A008481 A008482
Sequence in context: A072411 A091050 A005361 this_sequence A107345 A000688 A038538
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Jeffrey Shallit, Olivier Gerard (olivier.gerard(AT)gmail.com)
|
|
|
Search completed in 0.002 seconds
|
