

A088623


Prime obtained as the concatenation 1 followed by the smallest power of n, or 0 if no such number exists.


2



11, 0, 13, 0, 0, 0, 17, 0, 19, 0, 114641, 0, 113, 0, 0, 0, 1289, 0, 1361, 0, 11025506433613486607375777617584133309366191904729927960524981845743709132117581, 0, 1907846434775996175406740561329, 0, 0, 0, 127, 0, 1500246412961, 0, 131, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


LINKS

Table of n, a(n) for n=1..32.


FORMULA

a(2k)=a(5k)=0.  Ray Chandler, Oct 23 2003


MATHEMATICA

f[n_] := Block[{k = 1}, While[ p = ToExpression["1" <> ToString[n^k]]; !PrimeQ[p], k++ ]; p]; g[n_] := If[ Mod[n, 10] == 1  Mod[n, 10] == 3  Mod[n, 10] == 7  Mod[n, 10] == 9, f[n], 0]; Table[ g[n], {n, 1, 33}] (* Robert G. Wilson v, Oct 31 2003 *)


CROSSREFS

Cf. A088622.
Sequence in context: A127805 A256480 A088621 * A167166 A271572 A180059
Adjacent sequences: A088620 A088621 A088622 * A088624 A088625 A088626


KEYWORD

base,nonn


AUTHOR

Amarnath Murthy, Oct 19 2003


EXTENSIONS

Corrected and extended by Ray Chandler, Oct 23 2003


STATUS

approved



