This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A132174 #15 Mar 09 2024 11:54:02 %S A132174 1,5,10,21,44,92,189,385,778,1565,3141,6294,12602,25219,50454,100926, %T A132174 201871,403763,807548,1615119,3230263,6460552,12921132,25842293, %U A132174 51684616,103369264,206738561,413477157,826954350,1653908737,3307817513,6615635066,13231270174 %N A132174 Index of starting position of n-th generation of terms in A063882. %H A132174 Chai Wah Wu, <a href="/A132174/b132174.txt">Table of n, a(n) for n = 1..1002</a> %H A132174 B. Balamohan, A. Kuznetsov and S. Tanny, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL10/Tanny/tanny3.html">On the behavior of a variant of Hofstadter's Q-sequence</a>, J. Integer Sequences, Vol. 10 (2007), #07.7.1. %H A132174 <a href="/index/Ho#Hofstadter">Index entries for Hofstadter-type sequences</a> %H A132174 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (3, -2, 0, 0, 1, -3, 2). %F A132174 From _Chai Wah Wu_, May 17 2017: (Start) %F A132174 a(n) = 3*a(n-1) - 2*a(n-2) + a(n-5) - 3*a(n-6) + 2*a(n-7) for n > 8. %F A132174 G.f.: x*(-5*x^7 + x^6 - x^5 - x^4 - x^3 + 3*x^2 - 2*x - 1)/((x - 1)^2*(2*x - 1)*(x^4 + x^3 + x^2 + x + 1)). (End) %o A132174 (Python) %o A132174 from __future__ import division %o A132174 def A132174(n): %o A132174 if n == 1: %o A132174 return 1 %o A132174 if n == 2: %o A132174 return 5 %o A132174 h, m = divmod(n - 3, 5) %o A132174 return (382*2**(5*h + m)-10*2**m)//31- 7*h - m -(1 if m==3 else (-1 if m==4 else 2)) # _Chai Wah Wu_, May 17 2017 %K A132174 nonn %O A132174 1,2 %A A132174 _N. J. A. Sloane_, Nov 07 2007 %E A132174 More terms from _Chai Wah Wu_, May 17 2017