|
Search: id:A072565
|
|
|
| A072565 |
|
p(n+1)*p(n+2)+1 mod p(n), where p(n) is the n-th prime. |
|
+0
2
|
|
| 0, 0, 3, 4, 2, 12, 13, 3, 3, 17, 30, 25, 13, 41, 26, 49, 17, 0, 25, 17, 61, 41, 2, 8, 25, 13, 25, 13, 73, 27, 41, 49, 25, 121, 17, 73, 61, 41, 73, 49, 25, 121, 13, 25, 29, 90, 193, 25, 13, 41, 49, 25, 161, 73, 73, 49, 17, 61, 25, 25, 241, 253, 25, 13, 73, 281, 97, 121, 13
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
R. Crandall and C. Pomerance, Prime Numbers: A Computational Perspective, Springer-Verlag, NY, (2002 printing), Research problem 1.85, p. 73.
|
|
EXAMPLE
|
a(18) = p(19)*p(20)+1 mod p(18) = 67*71+1 mod 61 = 0.
|
|
MATHEMATICA
|
a[n_] := Mod[Prime[n+1]Prime[n+2]+1, Prime[n]]
|
|
CROSSREFS
|
Cf. A000040.
Equals A022461(n) + 1.
Sequence in context: A075593 A145421 A019474 this_sequence A159672 A059114 A166074
Adjacent sequences: A072562 A072563 A072564 this_sequence A072566 A072567 A072568
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
G. L. Honaker, Jr. (honak3r(AT)gmail.com), Aug 06 2002
|
|
EXTENSIONS
|
Edited by Dean Hickerson (dean.hickerson(AT)yahoo.com) and Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 10 2002
|
|
|
Search completed in 0.002 seconds
|
