|
Search: id:A040976
|
|
|
| A040976 |
|
a(n) = n-th prime - 2. |
|
+0
23
|
|
| 0, 1, 3, 5, 9, 11, 15, 17, 21, 27, 29, 35, 39, 41, 45, 51, 57, 59, 65, 69, 71, 77, 81, 87, 95, 99, 101, 105, 107, 111, 125, 129, 135, 137, 147, 149, 155, 161, 165, 171, 177, 179, 189, 191, 195, 197, 209, 221, 225, 227, 231, 237, 239, 249, 255, 261
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
Numbers n such that n! reduced mod(n+2) is 1. - Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 11 2002
The first a(n) numbers starting from 2 are divisible by primes up to p(n-1). - Lekraj Beedassy (blekraj(AT)yahoo.com), Jun 21 2006
Numbers n such that n^(n+1) = 1 mod n+2. - Zak Seidov (zakseidov(AT)yahoo.com), Jul 14 2005
Numbers n such that A110146(n)=1. Cf. A110147 n such that A110146(n)=0, A110146 mod(n^(n+1), n+2). - Zak Seidov (zakseidov(AT)yahoo.com), Jul 14 2005
The terms in this sequence are the cumulative sums of distances from one prime to another. For example for the distance from the first to 26th prime, 2 to 101, the cumulative sum of distances is 99, always the last prime, here 101, minus 2. - Enoch Haga (Enokh(AT)comcast.net), Apr 24 2006
The primes in this sequence are the initial primes of pairs of twin primes. - sebastiaoadasilva(AT)yahoo.com.br, Dec 21 2008
|
|
MATHEMATICA
|
Prime[Range[22]]-2 - Vladimir Orlovsky (4vladimir(AT)gmail.com), Apr 29 2008
|
|
CROSSREFS
|
Cf. A001223, A000040, A014689, A014692.
Sequence in context: A084060 A024896 A160771 this_sequence A166104 A164121 A078651
Adjacent sequences: A040973 A040974 A040975 this_sequence A040977 A040978 A040979
|
|
KEYWORD
|
nonn,nice,easy
|
|
AUTHOR
|
Felice Russo (felice.russo(AT)katamail.com)
|
|
|
Search completed in 0.003 seconds
|
