login

Revision History for A104375

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
Smallest prime formed by concatenation of n consecutive cubes, 0 if no such prime exists.
(history; published version)
#10 by Michel Marcus at Sat Feb 22 02:32:20 EST 2020
STATUS

reviewed

approved

#9 by Joerg Arndt at Sat Feb 22 02:26:35 EST 2020
STATUS

proposed

reviewed

#8 by Robert Israel at Thu Feb 20 15:01:48 EST 2020
STATUS

editing

proposed

Discussion
Fri Feb 21
00:12
Jon E. Schoenfield: I must be missing something here.  99999999999999999999999999999998^3 has 96 digits, right?  And 100000000000000000000000000000019^3 has 97 digits?  So how can their concatenation have 2132 digits?
00:19
Jon E. Schoenfield: Oh, okay, I get it -- "concatenation ... to" as in "concatenation ... through".   'Sorry, I read this much too quickly.  :-(
#7 by Robert Israel at Thu Feb 20 15:01:28 EST 2020
COMMENTS

If a(22) is nonzero, it has more than 500 2132 digits, too large for a b-file: it is the concatenation of 99999999999999999999999999999998^3 to 100000000000000000000000000000019^3. (End)

STATUS

proposed

editing

#6 by Robert Israel at Thu Feb 20 14:26:42 EST 2020
STATUS

editing

proposed

#5 by Robert Israel at Thu Feb 20 14:26:36 EST 2020
COMMENTS

From Robert Israel, Feb 20 2020: (Start)

a(n)=0 if n is divisible by 3, as the sum of three consecutive cubes is divisible by 3. - _Robert Israel_, Feb 20 2020

If a(22) is nonzero, it has more than 500 digits. (End)

#4 by Robert Israel at Thu Feb 20 14:13:52 EST 2020
COMMENTS

a(n)=0 if n is divisible by 3, as the sum of three consecutive cubes is divisible by 3. - Robert Israel, Feb 20 2020

LINKS

Robert Israel, <a href="/A104375/b104375.txt">Table of n, a(n) for n = 1..21</a>

MAPLE

for k from floor(n/2)*2+1 by 2 do

#3 by Robert Israel at Thu Feb 20 13:26:16 EST 2020
MAPLE

ccat:= proc(L)

local t, i;

t:= L[1];

for i from 2 to nops(L) do

t:= t*10^(ilog10(L[i])+1)+L[i]

od;

t

end proc:

f:= proc(n) local k, p;

if n mod 3 = 0 then return 0 fi;

for k from floor(n/2)*2+1 do

p:= ccat([seq((k-i)^3, i=n-1..0, -1)]);

if isprime(p) then return p fi

od

end proc:

f(1):= 0:

map(f, [$1..10]); # Robert Israel, Feb 20 2020

STATUS

approved

editing

#2 by Charles R Greathouse IV at Wed Oct 02 15:47:25 EDT 2013
AUTHOR

_Shyam Sunder Gupta (guptass(AT)rediffmail.com), _, Apr 17 2005

Discussion
Wed Oct 02
15:47
OEIS Server: https://oeis.org/edit/global/1962
#1 by N. J. A. Sloane at Tue Jul 19 03:00:00 EDT 2005
NAME

Smallest prime formed by concatenation of n consecutive cubes, 0 if no such prime exists.

DATA

0, 827, 0, 2744337540964913, 49135832685980009261, 0, 16194277163870641658137516777216169745931717351217373979, 64348566539203664467267512696859000696787170778887189057, 0

OFFSET

1,2

EXAMPLE

a(2)=827 because 827 is the smallest prime formed from concatenation of 2 consecutive cubes i.e. 8 and 27.

KEYWORD

base,nonn

AUTHOR

Shyam Sunder Gupta (guptass(AT)rediffmail.com), Apr 17 2005

STATUS

approved