Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082973
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A082973 Fibonacci numbers which are of the form Sum{i=1..k} prime(i) for some k. +0
1
2, 5, 2584 (list; graph; listen)
OFFSET

0,1

EXAMPLE

5 is in the sequence because 5 is both Fibonacci(5) and 2+3. 2584 is Fibonacci(18) and 2+3+5+7+11+...+151+157 (first 37 primes)

PROGRAM

(PARI) { ps=2; pc=1; fc=1; while (fc<50, while (ps<=fibonacci(fc), if (ps==fibonacci(fc), print1(ps"; "fc", ")); ps+=prime(pc++)); fc++) }

CROSSREFS

Sequence in context: A119748 A101341 A079014 this_sequence A082815 A115893 A057678

Adjacent sequences: A082970 A082971 A082972 this_sequence A082974 A082975 A082976

KEYWORD

nonn,bref

AUTHOR

Jon Perry (perry(AT)globalnet.co.uk), May 28 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research