Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A088782
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A088782 a(n) = smallest k>0 such that concatenation of n^k and 1 is prime, or 0 if no such number exists. +0
3
1, 2, 1, 1, 2, 1, 1, 2, 2, 1, 10, 0, 1, 6, 1, 3, 1356, 1, 1, 2, 1, 15, 0, 1, 1, 2, 1, 1, 4, 2, 1, 0, 1, 0, 2, 3, 2, 4, 4, 1, 2, 1, 1, 6, 0, 1, 2, 2, 1, 4, 3, 1, 16, 1, 9, 0, 1, 2, 36, 1, 165, 66, 1, 1, 0, 1, 0, 6, 1, 1, 2, 12, 3, 138, 1, 1, 4, 0, 5, 4, 1, 1, 2, 5, 2, 2, 3, 1, 0, 2, 1, 24, 2, 1, 42, 7, 1, 0, 1 (list; graph; listen)
OFFSET

1,2

MATHEMATICA

f[n_] := Block[{k = 1}, While[ !PrimeQ[10*n^k + 1], k++ ]; k]]; f[1] = 1; Table[ f[n], {n, 1, 99}] (from Robert G. Wilson v (rgwv(AT)rgwv.com), Oct 29 2003)

CROSSREFS

Cf. A088622, A088783.

Adjacent sequences: A088779 A088780 A088781 this_sequence A088783 A088784 A088785

Sequence in context: A050412 A025898 A025849 this_sequence A066672 A134024 A029316

KEYWORD

base,nonn

AUTHOR

Ray Chandler (rayjchandler(AT)sbcglobal.net), Oct 23 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 15 20:12 EDT 2008. Contains 145099 sequences.


AT&T Labs Research