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!)
A123139 a(n) = prime(n)*(prime(n + 1) + 1) - (n^3 + sum of digits of n^3). 0
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; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
A. Frank & P. Jacqueroux, International Contest, 2001. Item 30 = Item 21 - Item 24.
FORMULA
a(n) = A123134(n) - A123135(n). - Michel Marcus, Dec 03 2013
MATHEMATICA
Table[Prime[n](Prime[n+1]+1)-(n^3+Total[IntegerDigits[n^3]]), {n, 50}] (* Harvey P. Dale, Jul 03 2021 *)
PROG
(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: A019930 A169843 A329591 * A027599 A351297 A248272
KEYWORD
sign,base
AUTHOR
Herman Jamke (hermanjamke(AT)fastmail.fm), Sep 30 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 August 3 19:15 EDT 2024. Contains 374903 sequences. (Running on oeis4.)