|
Search: id:A123946
|
|
|
| A123946 |
|
a(3n)=floor(43*2^n/28)-1, a(3n+1)=a(3n)+3*2^(n-3), a(3n+2)=floor(17*2^n/7-6/7) for n>=3. |
|
+0
1
|
|
| 1, 1, 2, 2, 3, 4, 5, 7, 9, 11, 14, 18, 23, 29, 38, 48, 60, 76, 97, 121, 154, 195, 243, 310, 392, 488, 620, 785, 977, 1242, 1571, 1955, 2486, 3144, 3912, 4972, 6289, 7825, 9946, 12579, 15651, 19894, 25160, 31304, 39788, 50321, 62609, 79578, 100643, 125219
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
REFERENCES
|
D. E. Knuth, The Art of Computer Programming Vol. 3, Addison-Wesley, Reading, MA, 1998, p. 206, Exercise 14 (F. K. Hwang).
|
|
LINKS
|
R. L. Graham, Exercise 14
|
|
MAPLE
|
a[0]:=1: a[1]:=1: a[2]:=2: a[3]:=2: a[4]:=3: a[5]:=4: a[6]:=5: a[7]:=7: a[8]:=9: a[9]:=11: for n from 3 to 19 do a[3*n]:=floor(43*2^n/28)-1: a[3*n+1]:=a[3*n]+3*2^(n-3): a[3*n+2]:=floor(17*2^n/7-6/7) od: seq(a[n], n=0..59);
|
|
CROSSREFS
|
Sequence in context: A052816 A122130 A003073 this_sequence A002569 A129528 A052336
Adjacent sequences: A123943 A123944 A123945 this_sequence A123947 A123948 A123949
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Roger Bagula (rlbagulatftn(AT)yahoo.com), Oct 25 2006
|
|
EXTENSIONS
|
Edited by njas, Nov 07 2006
|
|
|
Search completed in 0.002 seconds
|
