Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093702
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093702 a(n) = smallest prime p>a(n-1) such that n divides (p-1) and (p-1)/n > (a(n-1)-1)/(n-1), a(1) = 2. +0
2
2, 5, 13, 29, 41, 61, 113, 137, 163, 191, 331, 373, 443, 491, 541, 593, 647, 739, 1103, 1181, 1303, 1409, 1657, 1753, 1901, 2003, 2161, 2269, 2437, 2551, 2729, 3041, 3169, 3299, 3571, 3709, 3923, 4219, 4447, 4721, 5003, 5167, 5333, 5501, 5851 (list; graph; listen)
OFFSET

1,1

COMMENT

A093701(n) = (a(n)-1)/n.

CROSSREFS

Cf. A066169.

Sequence in context: A049097 A045366 A158708 this_sequence A011756 A050950 A079991

Adjacent sequences: A093699 A093700 A093701 this_sequence A093703 A093704 A093705

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 10 2004

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 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research