|
Search: id:A005347
|
|
| |
|
| 1, 1, 2, 3, 5, 8, 13, 20, 34, 53, 88, 143, 236, 387, 641, 1061, 1763, 2937, 4903, 8202, 13750, 23095
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
This is example 42 in Guy's paper. The first seven terms are the same as the Fibonacci sequence A000045. Subsequent terms deviate from Fibonacci. - T. D. Noe (noe(AT)sspectra.com), May 08 2006
|
|
REFERENCES
|
Laatsch, Richard; Measuring the abundancy of integers. Math. Mag. 59 (1986), no. 2, 84-92.
R. K. Guy, The second strong law of small numbers. Math. Mag. 63 (1990), no. 1, 3-20.
|
|
FORMULA
|
a(n)=A005579(n+1)-A005579(n) - T. D. Noe (noe(AT)sspectra.com), May 08 2006
|
|
CROSSREFS
|
Cf. A005579 (least number of distinct prime factors in even numbers having an abundancy index >n).
Sequence in context: A013985 A092834 A080106 this_sequence A100582 A093093 A137290
Adjacent sequences: A005344 A005345 A005346 this_sequence A005348 A005349 A005350
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
njas, R. K. Guy
|
|
|
Search completed in 0.002 seconds
|
