Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A153385
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A153385 Number of primes <= Fib(Fib(n)) = PiPrime(A007570) +0
1
0, 0, 0, 0, 1, 3, 8, 51, 1329, 393790, 5670112879 (list; graph; listen)
OFFSET

0,6

LINKS

H. J. Smith, XICalc - Extra Precision Integer Calculator.

FORMULA

a(n) = PiPrime(Fibonacci(Fibonacci(n))

EXAMPLE

a(7) = 51 because Fib(7) = 13, Fib(13) = 233 and there are 51 primes <= 233.

MATHEMATICA

PrimePi@# & /@ (Fibonacci@Fibonacci@# & /@ Range@10) [From Robert G. Wilson, v (rgwv(AT)rgwv.com), Feb 17 2009]

PROGRAM

(Other) (XICalc) Pi(Fib(Fib(n)));

CROSSREFS

A007570

Sequence in context: A005444 A019044 A019035 this_sequence A026088 A121567 A101361

Adjacent sequences: A153382 A153383 A153384 this_sequence A153386 A153387 A153388

KEYWORD

nonn

AUTHOR

Harry J. Smith (hjsmithh(AT)sbcglobal.net), Dec 25 2008

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 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research