cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A211548 Sum of primes below Fibonacci(n).

Original entry on oeis.org

0, 0, 0, 0, 2, 5, 17, 28, 77, 160, 381, 874, 2127, 5117, 12339, 30504, 74139, 182109, 443685, 1111475, 2735692, 6782748, 16853486, 42013901, 104671293, 262299143, 657330956, 1650934893, 4150915841, 10458898439, 26396485368
Offset: 0

Views

Author

Alex Ratushnyak, Jun 26 2012

Keywords

Comments

a(n)*100/a(n-1):
250, 340, 164, 275, 207, 238, 229, 243, 240, 241, 247, 243, 245, 243, 250, 246, 247, 248, 249, 249, 250, 250, 251, 251, 251, 252

Examples

			Fibonacci(8)=21, sum of primes below 21 is 2+3+5+7+11+13+17+19=77, so a(8)=77.
		

Crossrefs

Programs

  • Mathematica
    Table[Total[Prime[Range[PrimePi[Fibonacci[n]-1]]]],{n,0,30}] (* Harvey P. Dale, Nov 18 2018 *)

Formula

a(n) ~ phi^(2n)/(10n log phi) where phi = (1+sqrt(5))/2 is the golden ratio. - Charles R Greathouse IV, Jun 26 2012