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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A073324 Smallest x such that Mod[p(x), c(x)]=n, where p(j) is the j-th prime, c(j) is the j-th composite number. 3
5, 1, 2, 8, 3, 242, 4, 245, 100, 8313, 10, 50190, 23, 8338, 3390, 12, 24, 308926, 13, 49, 25, 15, 26 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

FORMULA

a(n)=Min{x; Mod[A000040(x), A002808(x)]=n} =Min{x; A065859[x]=n}

EXAMPLE

x=10: p(10)=29,c(10)=18, Mod[29,18]=11 appears first here, so a(11)=10.

MATHEMATICA

f[x_] := Mod[Prime[x], FixedPoint[x+PrimePi[ # ]+1&, x]] t=Table[0, {256}]; Do[s=f[n]; If[s<257&&t[[s]]==0, t[[s]]=n], {n, 1, 400000}]; t

CROSSREFS

Cf. A000040, A002808, A065859, A073325, A073326.

Sequence in context: A011509 A144738 A021199 * A021665 A088781 A085608

Adjacent sequences:  A073321 A073322 A073323 * A073325 A073326 A073327

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jul 30 2002

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 15 20:26 EST 2012. Contains 205852 sequences.