|
| |
|
|
A132172
|
|
a(1) = ... = a(5) = 1; for n >= 6, a(n)=a(n-a(n-1))+a(n-a(n-5)).
|
|
2
| |
|
|
1, 1, 1, 1, 1, 2, 3, 4, 5, 6, 6, 7, 7, 8, 8, 10, 9, 11, 10, 13, 10, 14, 12, 15, 13, 17, 13, 18, 14, 19, 15, 19, 16, 24, 16, 23, 19, 24, 16, 30, 17, 25, 21, 30, 16, 33, 22, 30, 20, 43, 15, 38, 20, 48, 10, 50, 13, 40, 16, 73
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,6
|
|
|
COMMENTS
| a(61) is undefined.
|
|
|
LINKS
| B. Balamohan, A. Kuznetsov and S. Tanny, On the behavior of a variant of Hofstadter's Q-sequence, J. Integer Sequences, Vol. 10 (2007), #07.7.1.
Index entries for Hofstadter-type sequences
|
|
|
MAPLE
| a := proc(n) option remember; if n<=5 then 1 else if n > a(n-1) and n > a(n-5) then RETURN(a(n-a(n-1))+a(n-a(n-5))); else ERROR(" died at n= ", n); fi; fi; end;
|
|
|
CROSSREFS
| Sequence in context: A091987 A025544 A121856 * A080680 A005376 A196362
Adjacent sequences: A132169 A132170 A132171 * A132173 A132174 A132175
|
|
|
KEYWORD
| nonn,fini,full
|
|
|
AUTHOR
| T. D. Noe and N. J. A. Sloane (njas(AT)research.att.com), Nov 06 2007
|
| |
|
|
