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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A076229 Smallest number such that A076228(a(n)) = n. 0
2, 3, 5, 7, 6, 9, 20, 12, 14, 19, 22, 41, 18, 55, 28, 33, 37, 58, 36, 50, 59, 65, 57, 66, 78, 110, 118, 109, 114, 108, 199, 129, 146, 145, 188, 164, 278, 246, 265, 171, 195, 250, 193, 194, 216, 313, 430, 380, 429, 291, 257, 293, 290, 258, 639, 391, 411, 415, 572 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..59.

FORMULA

a[n]=Min{x; A076228[x]=n]}

EXAMPLE

n=6:a[6]=9 because first in iteration list started with 9, i.e. in {9, 28, 14, 7, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1}, occurs first n=six sinking below iv=9: at {7, 5, 8, 4, 2, 1}.

MATHEMATICA

f[x_] := (1-Mod[x, 2])*(x/2)+(Mod[x, 2])*(3*x+1); f[1]=1; f0[x_] := Delete[FixedPointList[f, x], -1] f1[x_] := f0[x]-Part[f0[x], 1] g[x_] := Count[Sign[f1[x]], -1] t=Table[0, {256}]; Do[s=g[n]; If[s<257&&t[[s]]==0, t[[s]]=n], {n, 1, 1000}]; t

CROSSREFS

Cf. A006370, A074473, A076228.

Sequence in context: A115274 A126890 A122637 * A160102 A318954 A296375

Adjacent sequences:  A076226 A076227 A076228 * A076230 A076231 A076232

KEYWORD

nonn

AUTHOR

Labos Elemer, Oct 01 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 16 06:18 EDT 2019. Contains 328046 sequences. (Running on oeis4.)