cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A232268 Numbers n such that reversal (n^3) plus 1 is prime.

This page as a plain text file.
%I A232268 #8 Nov 27 2013 05:06:39
%S A232268 1,3,4,6,10,19,28,30,31,40,60,63,64,66,87,88,93,96,100,129,132,135,
%T A232268 138,141,144,184,190,274,279,280,283,285,292,294,297,300,303,310,393,
%U A232268 399,400,402,433,436,439,589,597,598,600,612,616,621,628,630,639,640,642
%N A232268 Numbers n such that reversal (n^3) plus 1 is prime.
%C A232268 If n is a multiple of 10, after reversal leading zeros are discarded before adding 1.
%H A232268 K. D. Bajpai, <a href="/A232268/b232268.txt">Table of n, a(n) for n = 1..10000</a>
%e A232268 a(3)= 4: 4^3= 64: reversing the digits gives 46: 46+1= 47 which is prime.
%e A232268 a(4)= 6: 6^3= 216: reversing the digits gives 612: 612+1= 613 which is prime.
%e A232268 a(12)= 63: 63^3= 250047: reversing the digits gives 740052: 740052+1= 740053 which is prime.
%p A232268 with(StringTools): KD:= proc() local a; a:= parse(Reverse(convert((n^3), string)))+1; if isprime(a) then RETURN (n): fi;end: seq(KD(), n=1..5000);
%t A232268 Select[Range[500],PrimeQ[ToExpression[StringReverse[ToString[#^3]]] + 1] &]
%Y A232268 Cf. A059008 (numbers n:  n^3 reversed is prime).
%Y A232268 Cf. A231756 (numbers n:  reversal (n^2) plus 1 is prime).
%K A232268 nonn,base,less
%O A232268 1,2
%A A232268 _K. D. Bajpai_, Nov 22 2013