|
Search: id:A130155
|
|
|
| A130155 |
|
a(1)=1. a(n) = number of earlier terms of the sequence which divide the n-th Fibonacci number. |
|
+0
2
|
|
| 1, 1, 2, 2, 2, 5, 2, 2, 7, 3, 2, 9, 2, 2, 11, 4, 2, 12, 2, 5, 12, 2, 2, 20, 4, 2, 15, 3, 2, 22, 2, 5, 17, 2, 5, 26, 2, 2, 20, 11, 2, 24, 2, 4, 27, 2, 2, 34, 2, 8, 25, 4, 2, 33, 6, 5, 26, 2, 2, 52, 2, 2, 34, 5, 8, 36, 2, 4, 31, 10, 2, 52, 2, 2, 42, 4, 2, 43, 2, 15, 39, 2, 2, 59, 8, 2, 39, 6, 2, 65, 2
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
EXAMPLE
|
The 10th Fibonacci number is 55. Among terms (a(1),a(2),...a(9)) there are 3 terms (a(1)=1,a(2)=1,a(6)=5)) that divide 55; so a(10) = 3.
|
|
MAPLE
|
A130155 := proc(nmax) local a, nfib, anew, i; a := [1] ; while nops(a) < nmax do n := nops(a)+1 ; nfib := combinat[fibonacci](n) ; anew :=0 ; for i from 1 to nops(a) do if nfib mod op(i, a) = 0 then anew := anew+1 ; fi ; od ; a := [op(a), anew] ; od ; RETURN(a) ; end: A130155(100) ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 07 2007
|
|
CROSSREFS
|
Cf. A130156.
Adjacent sequences: A130152 A130153 A130154 this_sequence A130156 A130157 A130158
Sequence in context: A121358 A112659 A115281 this_sequence A113516 A120642 A095370
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet (qq-quet(AT)mindspring.com), May 13 2007
|
|
EXTENSIONS
|
More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 07 2007
|
|
|
Search completed in 0.002 seconds
|
