login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A108963 Smallest prime == 1 (mod f(n)), where f(n) = concatenation n,(n-1),...,3,2,1,2,3,...(n-1),n. 1
2, 1061, 963691, 12963703, 3259274071, 1701235209857, 122469139753073, 4382716061728391, 1185185185481481469, 1318518518548148146921, 8887901234569876543128089, 460221753086420691357985842257, 2886644417283950671604936022446687, 40980512218641975315802468839322518107 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

CROSSREFS

Cf. A109947, A109948, A109949.

Sequence in context: A166852 A111203 A159858 * A152510 A039951 A135618

Adjacent sequences:  A108960 A108961 A108962 * A108964 A108965 A108966

KEYWORD

nonn,base

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 20 2005

EXTENSIONS

More terms from Sean A. Irvine (sairvin(AT)xtra.co.nz), Nov 29 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 08:13 EST 2012. Contains 205893 sequences.