|
Search: id:A101201
|
|
|
| A101201 |
|
Numbers n such that n^3 is equal to the sum of n distinct primes. |
|
+0
3
|
|
| 0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
a(n) = (1+pn) mod (1+q+(1+qp)n) where p > 1, q >= 0. For example a(n) = (1+2n) mod (1+n), (2+3n), (3+5n), (4+7n), ... a(n) = (1+3n) mod (1+n), (2+4n), (3+7n), (4+10n), ... a(n) = (1+4n) mod (1+n), (2+5n), (3+9n), (4+13n), ... - Neville Holmes (neville.holmes(AT)utas.edu.au), Feb 09 2005
Except for squares, all perfect powers n^a are equal to the sum of n distinct primes; also numbers of the form n^a + n^a-1 + n^a-m + ... + n is equal to the sum of n distinct primes. - Giovanni Teofilatto (g.teofilatto(AT)tiscalinet.it), Jan 21 2006
Except for term a(2)=2, a(k) is the number of k primes whose sum is equal to k! or k! + 1, where k! is a factorial number; also p# and p# + 1 is equal to the sum of p distinct prime, where p# is a primorial number. - Giovanni Teofilatto (g.teofilatto(AT)tiscalinet.it), Feb 06 2006
|
|
CROSSREFS
|
Sequence in context: A061019 A028310 A097045 this_sequence A118759 A118760 A119972
Adjacent sequences: A101198 A101199 A101200 this_sequence A101202 A101203 A101204
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Giovanni Teofilatto (g.teofilatto(AT)tiscalinet.it), Dec 12 2004
|
|
|
Search completed in 0.002 seconds
|
