|
Search: id:A123139
|
|
|
| A123139 |
|
a(n) = prime(n)*(prime(n + 1) + 1) - (n^3 + sum of digits of n^3). |
|
+0
1
|
|
| 6, 2, 4, 10, 21, 9, -13, -64, -57, -73, -161, -192, -412, -697, -855, -935, -1272, -1702, -2063, -2754, -3439, -4031, -4714, -5120, -5750, -7098, -8586, -10201, -11989, -12545, -13055, -14716, -16784, -18473, -20253, -22825, -24924, -27514, -30288, -32870, -36369, -39363, -42481, -46996, -51743
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
A. Frank & P. Jacqueroux, International Contest, 2001. Item 30 = Item 21 - Item 24.
|
|
PROGRAM
|
(PARI) for(n=1, 50, sda=eval(Vec(Str(n^3))); print1(prime(n)*(prime(n+1)+1)-(n^3+sum(i=1, length(sda), sda[i])), ", "))
|
|
CROSSREFS
|
Sequence in context: A020831 A135617 A019930 this_sequence A027599 A058160 A033939
Adjacent sequences: A123136 A123137 A123138 this_sequence A123140 A123141 A123142
|
|
KEYWORD
|
sign,base
|
|
AUTHOR
|
Herman Jamke (hermanjamke(AT)fastmail.fm), Sep 30 2006
|
|
|
Search completed in 0.002 seconds
|
