|
Search: id:A129896
|
|
|
| A129896 |
|
a(1)=1. a(n) = a(n-1) + number of Fibonacci numbers among the first (n-1) terms of the sequence. |
|
+0
2
|
|
| 1, 2, 4, 6, 8, 11, 14, 17, 20, 23, 26, 29, 32, 35, 38, 41, 44, 47, 50, 53, 56, 59, 62, 65, 68, 71, 74, 77, 80, 83, 86, 89, 93, 97, 101, 105, 109, 113, 117, 121, 125, 129, 133, 137, 141, 145, 149, 153, 157, 161, 165, 169, 173, 177, 181, 185, 189, 193, 197, 201, 205, 209
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
The Fibonacci numbers in this sequence are: 1, 2, 8, 89, 233, 46368, 14930352, ..., . (A131349) - Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 02 2007
|
|
MATHEMATICA
|
fibQ[n_] := (Fibonacci@ Round@ Log[ GoldenRatio, n*Sqrt@5] == n); f[lst_] := Append[lst, Last@lst + Length@Select[lst, fibQ@# &]]; Nest[f, {1}, 38] - Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 02 2007
|
|
CROSSREFS
|
Sequence in context: A070978 A027919 A077473 this_sequence A134421 A092777 A006463
Adjacent sequences: A129893 A129894 A129895 this_sequence A129897 A129898 A129899
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet (qq-quet(AT)mindspring.com), Jun 04 2007
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 02 2007
|
|
|
Search completed in 0.003 seconds
|
