|
Search: id:A006158
|
|
|
| A006158 |
|
a(n)=a(a(n-3))+a(n-a(n-3)).
(Formerly M0447)
|
|
+0
4
|
|
| 1, 1, 1, 2, 3, 4, 4, 4, 5, 6, 6, 7, 8, 8, 8, 8, 9, 10, 10, 11, 12, 13, 13, 14, 15, 16, 16, 16, 16, 16, 16, 16, 17, 18, 18, 19, 20, 21, 21, 22, 23, 24, 25, 25, 26, 27, 28, 29, 29, 29, 29, 29, 30, 31, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 33, 34, 34, 35, 36, 37, 37, 38, 39, 40, 41
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
REFERENCES
|
J. Arkin, D. C. Arney, L. S. Dewald and W. E. Ebel, Jr., Families of recursive sequences, J. Rec. Math., 22 (No. 22, 1990), 85-94.
B. W. Conolly, ``Meta-Fibonacci sequences,'' in S. Vajda, editor, Fibonacci and Lucas Numbers, and the Golden Section. Halstead Press, NY, 1989, pp. 127-138.
|
|
MAPLE
|
a := proc(n) option remember: if 1 <= n and n <=3 then RETURN(1) fi: a(a(n-3)) +a(n-a(n-3)) end: for n from 1 to 100 do printf(`%d, `, a(n)) od:
|
|
CROSSREFS
|
Sequence in context: A123273 A073425 A087876 this_sequence A135414 A140087 A099479
Adjacent sequences: A006155 A006156 A006157 this_sequence A006159 A006160 A006161
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), Apr 20 2001
|
|
|
Search completed in 0.002 seconds
|
