login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A215823 Prime numbers p such that the Fibonacci number F(p) can be written in the form a^2 + 3*b^2. 3
2, 7, 17, 23, 47, 71, 73, 79, 89, 137, 151, 167, 191, 193, 199, 257, 271, 353, 359, 409, 431, 433, 449, 569, 601, 719, 751, 809, 823, 857, 881, 887, 929, 953 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
These Fibonacci numbers F(p) have no prime factor congruent to 2 (mod 3) to an odd power.
LINKS
PROG
(PARI) forprime(i=2, 500, a=factorint(fibonacci(i))~; has=0; for(j=1, #a, if(a[1, j]%3==2&&a[2, j]%2==1, has=1; break)); if(has==0, print(i", ")))
CROSSREFS
Sequence in context: A049546 A049578 A162574 * A049542 A049582 A220273
KEYWORD
nonn
AUTHOR
V. Raman, Aug 23 2012
EXTENSIONS
15 more terms from 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 04:13 EDT 2024. Contains 371235 sequences. (Running on oeis4.)