Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A108963
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A108963 Smallest prime == 1 (mod f(n)), where f(n) = concatenation n,(n-1),...,3,2,1,2,3,...(n-1),n. +0
2
2, 1061, 963691, 12963703 (list; graph; listen)
OFFSET

1,1

CROSSREFS

Cf. A109947, A109948, A109949.

Sequence in context: A004897 A004802 A111203 this_sequence A013543 A039951 A135618

Adjacent sequences: A108960 A108961 A108962 this_sequence A108964 A108965 A108966

KEYWORD

base,more,nonn

AUTHOR

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

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 July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research