Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A106735
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A106735 Numbers n such that n=p(m) (mod p(m+1)) for any m, where p(m) is the m-th prime. +0
1
2, 3, 5, 7, 8, 11, 12, 13, 14, 17, 18, 19, 20, 23, 24, 26, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 40, 41, 42, 43, 44, 47, 48, 50, 51, 52, 53, 54, 55, 56, 58, 59, 60, 61, 62, 63, 64, 65, 67, 68, 71, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 86, 88, 89, 90, 91, 92, 93, 95 (list; graph; listen)
OFFSET

1,1

EXAMPLE

24 because 24 mod 13 = 11. 40 because 40 mod 7 = 5. 51 because 51 mod 11 = 7.

MATHEMATICA

nn=150; u={}; Do[lst=Prime[i]+Range[0, Ceiling[nn/Prime[i+1]]]Prime[i+1]; u=Union[u, lst], {i, PrimePi[nn]}]; Intersection[u, Range[nn]] (Noe)

CROSSREFS

Sequence in context: A159556 A028728 A028743 this_sequence A082634 A100959 A166982

Adjacent sequences: A106732 A106733 A106734 this_sequence A106736 A106737 A106738

KEYWORD

nonn

AUTHOR

Christopher M. Tomaszewski (cmt1288(AT)comcast.net), May 14 2005

EXTENSIONS

Corrected and extended by T. D. Noe (noe(AT)sspectra.com), Oct 25 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 November 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research