login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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; text; internal format)
OFFSET

1,6

COMMENTS

a(61) is undefined.

LINKS

Table of n, a(n) for n=1..60.

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: A121856 A332061 A317442 * A080680 A005376 A196362

Adjacent sequences:  A132169 A132170 A132171 * A132173 A132174 A132175

KEYWORD

nonn,fini,full

AUTHOR

T. D. Noe and N. J. A. Sloane, Nov 06 2007

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 11 23:53 EDT 2020. Contains 335654 sequences. (Running on oeis4.)