Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A073323
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A073323 Smallest x such that A073259[x]=n; the first number of which length of fixed-point-list terminated by x-th composite number equals n. +0
1
0, 0, 4, 1, 29, 153, 4913, 73114, 1985627 (list; graph; listen)
OFFSET

1,3

COMMENT

Occurrences of lengths [1-10] for n<=10000000 are {0,0,64,4662,310495,6468633,3041909,173579,658,0}.

FORMULA

a(n)=Min{x; A073259[x]=n}

EXAMPLE

For lengths n=3, 4, 5, 6, 7, 8 the corresponding lists are: {4, 7, 9}, {1, 2, 3, 4}, {29, 40, 42, 43, 44}, {153, 190, 196, 198, 199, 200}, {4913, 5570, 5649, 5656, 5658, 5659, 5660} and {73114, 80343, 80982, 81039, 81046, 81048, 81049, 81050}.

MATHEMATICA

lfp[x_] := Length[FixedPointList[x + PrimePi[ # ] + 1 &, x]]-1 t=Table[0, {15}]; Do[s=lfp[n]; If[s<16&&t[[s]]==0, t[[s]]=n], {n, 1, 100000}]; t

CROSSREFS

Cf. A002808, A073259, A073320-A073322.

Adjacent sequences: A073320 A073321 A073322 this_sequence A073324 A073325 A073326

Sequence in context: A114150 A134149 A035469 this_sequence A077097 A123126 A051142

KEYWORD

more,nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jul 29 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 October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research