Svoboda | Graniru | BBC Russia | Golosameriki | Facebook
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!)
A122869 Primes p that divide Lucas((p-1)/2), where Lucas is A000032. 4
11, 19, 31, 59, 71, 79, 131, 139, 151, 179, 191, 199, 211, 239, 251, 271, 311, 331, 359, 379, 419, 431, 439, 479, 491, 499, 571, 599, 619, 631, 659, 691, 719, 739, 751, 811, 839, 859, 911, 919, 971, 991, 1019, 1031, 1039, 1051, 1091, 1151, 1171, 1231, 1259 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Final digit of a(n) is 1 or 9.
A002145 is the union of this sequence and A122870, Primes p that divide Lucas((p+1)/2).
Conjecture: This sequence is just the primes congruent to 11 or 19 mod 20. - Charles R Greathouse IV, May 25 2011
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..1000 from Vincenzo Librandi)
Eric Weisstein's World of Mathematics, Gaussian Prime.
Eric Weisstein's World of Mathematics, Lucas Number.
MATHEMATICA
Select[Prime[Range[1000]], IntegerQ[(Fibonacci[(#1-1)/2-1]+Fibonacci[(#1-1)/2+1])/#1]&]
PROG
(PARI) lista(kmax) = {my(lucas1 = 1, lucas2 = 3, lucas3, p); for(k = 3, kmax, lucas3 = lucas1 + lucas2; p = 2*k + 1; if(isprime(p) && !(lucas3 % p), print1(p, ", ")); lucas1 = lucas2; lucas2 = lucas3); } \\ Amiram Eldar, Jun 06 2024
CROSSREFS
Subsequence of A002145, A003626, A040105, A040147 and A064739.
Sequence in context: A357426 A152091 A272550 * A106535 A178150 A214784
KEYWORD
nonn
AUTHOR
Alexander Adamchuk, Sep 16 2006
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 September 8 21:25 EDT 2024. Contains 375759 sequences. (Running on oeis4.)