Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A076229
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A076229
%S A076229 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,
%T A076229 110,118,109,114,108,199,129,146,145,188,164,278,246,265,171,195,250,
%U A076229 193,194,216,313,430,380,429,291,257,293,290,258,639,391,411,415,572
%N A076229 Smallest number such that A076228[a[n]]=n.
%F A076229 a[n]=Min{x; A076228[x]=n]}
%e A076229 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}.
%p A076229 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
%Y A076229 Cf. A006370, A074473, A076228.
%Y A076229 Sequence in context: A115274 A126890 A122637 this_sequence A160102 A137750 
               A156900
%Y A076229 Adjacent sequences: A076226 A076227 A076228 this_sequence A076230 A076231 
               A076232
%K A076229 nonn
%O A076229 1,1
%A A076229 Labos E. (labos(AT)ana.sote.hu), Oct 01 2002

    
page 1

Search completed in 0.001 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 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research