Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A101279
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A101279
%S A101279 1,1,1,1,2,1,3,1,4,2,5,1,6,3,7,1,8,4,9,2,10,5,11,1,12,6,13,3,14,7,15,1,
%T A101279 16,8,17,4,18,9,19,2,20,10,21,5,22,11,23,1,24,12,25,6,26,13,27,3,28,14,
%U A101279 29,7,30,15,31,1,32,16,33,8,34,17,35,4,36,18,37,9,38,19,39,2,40,20,41,
               10
%N A101279 a(1) = 1; a(2k) = a(k), a(2k+1) = k.
%F A101279 a((n+1)/2)=A028310(n) if n is odd and a(n/2)=a(n) if n is even; thus 
               this is a fractal sequence. - Robert G. Wilson v May 23 2006; corrected 
               by Clark Kimberling (ck6(AT)evansville.edu), Jul 07 2007
%e A101279 If n is a power of 2 then k=1.
%p A101279 a:=array(0..200); a[1]:=1; M:=200; for n from 2 to M do if n mod 2 = 
               1 then a[n]:=(n-1)/2; else a[n]:=a[n/2]; fi; od: [seq(a[n],n=1..M)];
%t A101279 a[1] = 1; a[n_] := a[n] = If[OddQ@n, (n - 1)/2, a[n/2]]; Array[a, 84] 
               (from Robert G. Wilson v (rgwv(at)rgwv.com), May 23 2006)
%Y A101279 Cf. A003602, A025480.
%Y A101279 Sequence in context: A078898 A130747 A055440 this_sequence A064576 A113308 
               A143862
%Y A101279 Adjacent sequences: A101276 A101277 A101278 this_sequence A101280 A101281 
               A101282
%K A101279 nonn
%O A101279 1,5
%A A101279 N. J. A. Sloane (njas(AT)research.att.com), May 22 2006; definition corrected 
               May 23 2006

    
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 21 10:15 EST 2009. Contains 171081 sequences.


AT&T Labs Research