|
Search: id:A159977
|
|
|
| A159977 |
|
Distance of consecutive Fibonacci terms to nxtprm(n)(0 if already prime) |
|
+0
2
|
|
| 1, 1, 0, 0, 0, 3, 0, 2, 3, 4, 0, 5, 0, 2, 3, 4, 0, 7, 20, 14, 3, 2, 0, 13, 4, 10, 11, 16, 0, 23, 4, 4, 25, 10, 14, 35, 6, 24, 3, 2, 6, 7, 0, 20, 9, 48, 0, 5, 28, 18, 23, 14, 14, 11, 16, 10, 21, 4, 62, 13, 38, 12, 7, 16, 12, 19, 36, 28, 143, 32, 58, 29, 96, 100, 33, 2, 30, 27, 12, 62, 25, 46, 0
(list; graph; listen)
|
|
|
OFFSET
|
1,6
|
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..1000
|
|
FORMULA
|
Fibonacci sequence 1 1 2 3 5 8 13 21 34 . . . . Compute distance to next prime unless already prime.
|
|
EXAMPLE
|
a(1) and a(2) both = 1 because distance from 1 to nxtprm(2) is 1 in both cases, while a(3), a(4), a(5) are all 0 because 2,3,5 are all prime so 0 distance.
|
|
PROGRAM
|
(Other) UBASIC: 10 'FiboA 20 A=1:print A; 30 B=1:print B; 40 C=A+B:print C; :T=T+1 41 if C<>prmdiv(C) then print "<"; nxtprm(C)-C; ">":else print "<"; 0; ">"; 50 D=B+C:print D; 51 if D<>prmdiv(D) then print "<"; nxtprm(D)-D; ">":else print "<"; 0; ">"; 60 A=C:B=D:if T>22 then stop:else 40
(PARI) F=1; G=0; for(i=1, 100, print1(nextprime(F)-F, ", "); T=F; F+=G; G=T) [From Hagen von Eitzen (math(AT)von-eitzen.de), Jul 20 2009]
|
|
CROSSREFS
|
A159978
Sequence in context: A143394 A112455 A001608 this_sequence A112974 A113069 A136163
Adjacent sequences: A159974 A159975 A159976 this_sequence A159978 A159979 A159980
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Enoch Haga (Enokh(AT)comcast.net), Apr 28 2009
|
|
EXTENSIONS
|
More terms (cf. b-file) from Hagen von Eitzen (math(AT)von-eitzen.de), Jul 20 2009
|
|
|
Search completed in 0.003 seconds
|
