Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A114789
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A114789 a(1) = 1, a(2) = 3 and thereafter a(n) is the smallest number congruent to 1 mod a(n-1) and having the prime signatute of n. +0
3
1, 3, 7, 169, 677, 1355, 2711, 4304496906163, 1852869361516769972676380161, 66703297014603719016349685797, 400219782087622314098098114783, 31217143002834540499651652953075, 307176687147891878516572265058259 (list; graph; listen)
OFFSET

1,2

EXAMPLE

a(4) = 169 = 13^2 has a prime signature of 4 = 2^2 and 169 == 1 (mod 7 = a(3)).

CROSSREFS

Adjacent sequences: A114786 A114787 A114788 this_sequence A114790 A114791 A114792

Sequence in context: A006031 A119958 A031881 this_sequence A128273 A105763 A132564

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jan 05 2006

EXTENSIONS

Corrected and extended by Joshua Zucker (joshua.zucker(AT)stanfordalumni.org), May 07 2006

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 November 8 20:39 EST 2009. Contains 166234 sequences.


AT&T Labs Research