Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A073324
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
4
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; listen)
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 this_sequence A021665 A088781 A085608

Adjacent sequences: A073321 A073322 A073323 this_sequence A073325 A073326 A073327

KEYWORD

nonn

AUTHOR

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

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 December 9 18:50 EST 2009. Contains 170568 sequences.


AT&T Labs Research