The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A283895 Relative of Hofstadter Q-sequence: a(1) = 41, a(2) = 2; thereafter a(n) = a(n-a(n-1)) + a(n-a(n-2)). 5
 41, 2, 41, 2, 41, 2, 41, 2, 41, 2, 41, 2, 41, 2, 41, 2, 41, 2, 41, 2, 41, 2, 41, 2, 41, 2, 41, 2, 41, 2, 41, 2, 41, 2, 41, 2, 41, 2, 41, 2, 41, 43, 2, 84, 2, 84, 2, 84, 2, 84, 2, 84, 2, 84, 2, 84, 2, 84, 2, 84, 2, 84, 2, 84, 2, 84, 2, 84, 2, 84, 2, 84, 2, 84, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS In calculating terms of this sequence, use the convention that a(n)=0 for n<=0. Most terms in this sequence alternate between 2 and a large constant. Such runs of terms are eventually separated by either 224 or 562 other terms, and each run is approximately twice as long as the previous. LINKS Nathan Fox, Table of n, a(n) for n = 1..50000 MAPLE A283895:=proc(n) option remember: if n <= 0 then 0: elif n = 1 then 41: elif n = 2 then 2: else A283895(n-A283895(n-1)) + A283895(n-A283895(n-2)): fi: end: CROSSREFS Cf. A005185, A278066, A278067, A278068, A283893, A283894, A283896, A283897. Sequence in context: A214337 A053342 A297205 * A051317 A036189 A198190 Adjacent sequences:  A283892 A283893 A283894 * A283896 A283897 A283898 KEYWORD nonn AUTHOR Nathan Fox, Mar 19 2017 STATUS approved

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

Last modified May 28 15:04 EDT 2022. Contains 354115 sequences. (Running on oeis4.)