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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A215818 Numbers n such that the Fibonacci number F(n) can be written in the form a^2 + 2*b^2. 3
1, 2, 3, 4, 6, 9, 11, 12, 13, 18, 23, 25, 26, 33, 36, 39, 47, 52, 59, 61, 71, 83, 107, 109, 121, 122, 131, 141, 157, 167, 179, 183, 191, 193, 227, 244, 249, 251, 299, 314, 321, 337, 359, 363, 383, 393, 397, 423, 431, 433, 471, 501, 517, 579, 587, 601, 628, 647, 649, 794, 866, 877, 911, 913, 947, 1079, 1091, 1093 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

These Fibonacci numbers F(n) have no prime factor congruent to 5 or 7 mod 8 to an odd power.

LINKS

Table of n, a(n) for n=1..68.

Blair Kelly, Fibonacci and Lucas factorizations

MATHEMATICA

Select[Range[200], Length[FindInstance[x^2 + 2 y^2 == Fibonacci[#], {x, y}, Integers]] > 0 &] (* T. D. Noe, Aug 27 2012 *)

PROG

(PARI) for(i=2, 500, a=factorint(fibonacci(i))~; has=0; for(j=1, #a, if(a[1, j]%8>4&&a[2, j]%2==1, has=1; break)); if(has==0, print(i", ")))

CROSSREFS

Cf. A000045, A215819, A215820, A215821.

Sequence in context: A175515 A241241 A260343 * A132600 A163627 A189887

Adjacent sequences:  A215815 A215816 A215817 * A215819 A215820 A215821

KEYWORD

nonn

AUTHOR

V. Raman, Aug 23 2012

EXTENSIONS

1 added by T. D. Noe, Aug 27 2012

Added the number 25 and 24 more terms - V. Raman, Aug 28 2012

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 16 00:33 EST 2019. Contains 330013 sequences. (Running on oeis4.)