Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A073257
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A073257 Smallest n such that GCD[c(x),x]=GCD[A002808(x),x]=A064814(x)=n. +0
1
1, 2, 12, 20, 5, 6, 7, 64, 234, 50, 55, 24, 26, 28, 30, 32, 629, 1008, 209, 220, 231, 1012, 506, 168, 425, 182, 189, 2716, 2204, 1080, 93, 96, 99, 2176, 105, 4428, 1369, 5586, 1755, 1800, 6109, 2478, 2279, 3916, 5760, 644, 4606, 1920, 1960, 10250, 2040, 2444 (list; graph; listen)
OFFSET

1,2

FORMULA

a(n)=Min{x; GCD[c(x), x]=n}, where c(x) is the x-th composite number.

EXAMPLE

50th composite is 70,GCD[50,70]=10 appears first here, a(10)=50.

MATHEMATICA

f[x_] := FixedPoint[x+PrimePi[ # ]+1&, x] t=Table[0, {100}]; Do[s=GCD[f[n], n]; If[s<101&&t[[s]]==0, t[[s]]=n], {n, 1, 100000}]; t

CROSSREFS

Cf. A064814, A002808, A073255-A073264.

Sequence in context: A115109 A048001 A109299 this_sequence A011532 A043497 A051804

Adjacent sequences: A073254 A073255 A073256 this_sequence A073258 A073259 A073260

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jul 22 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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research