login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A121569 Fibonacci[ (p+3)/2 ] - 1, where p = Prime[n]. 0
1, 2, 4, 12, 20, 54, 88, 232, 986, 1596, 6764, 17710, 28656, 75024, 317810, 1346268, 2178308, 9227464, 24157816, 39088168, 165580140, 433494436, 1836311902, 12586269024, 32951280098, 53316291172, 139583862444, 225851433716 (list; graph; refs; listen; history; internal format)
OFFSET

2,2

COMMENTS

p = Prime[n] divides a(n) for p = {29,89,101,181,229,349,401,461,509,521,541,709,761,769,809,...} = A047650[n] Primes for which golden mean tau is a quadratic residue or Primes of the form x^2+20y^2.

FORMULA

a(n) = Fibonacci[ (Prime[n]+3)/2 ] - 1, n>1. a(n) = Sum[ Fibonacci[k], {k,1,(p-1)/2} ], p = Prime[n], n>1.

MATHEMATICA

Table[Fibonacci[(Prime[n]+3)/2]-1, {n, 2, 50}]

CROSSREFS

Cf. A000045, A121567, A121568, A033205, A045468, A064739, A047650.

Sequence in context: A056228 A166869 A168380 * A099603 A062767 A173650

Adjacent sequences:  A121566 A121567 A121568 * A121570 A121571 A121572

KEYWORD

nonn

AUTHOR

Alexander Adamchuk (alex(AT)kolmogorov.com), Aug 08 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 23:58 EST 2012. Contains 206085 sequences.