|
Search: id:A101279
|
|
|
| A101279 |
|
a(1) = 1; a(2k) = a(k), a(2k+1) = k. |
|
+0
3
|
|
| 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, 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, 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
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
FORMULA
|
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
|
|
EXAMPLE
|
If n is a power of 2 then k=1.
|
|
MAPLE
|
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)];
|
|
MATHEMATICA
|
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)
|
|
CROSSREFS
|
Cf. A003602, A025480.
Sequence in context: A078898 A130747 A055440 this_sequence A064576 A113308 A143862
Adjacent sequences: A101276 A101277 A101278 this_sequence A101280 A101281 A101282
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), May 22 2006; definition corrected May 23 2006
|
|
|
Search completed in 0.002 seconds
|
