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 A092277 #30 Nov 29 2024 21:10:57 %S A092277 0,8,30,66,116,180,258,350,456,576,710,858,1020,1196,1386,1590,1808, %T A092277 2040,2286,2546,2820,3108,3410,3726,4056,4400,4758,5130,5516,5916, %U A092277 6330,6758,7200,7656,8126,8610,9108,9620,10146,10686,11240,11808,12390,12986,13596 %N A092277 a(n) = 7*n^2 + n. %C A092277 First bisection of A219191. - _Bruno Berselli_, Nov 15 2012 %H A092277 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (3,-3,1). %F A092277 a(n) = 7*A000290(n) + n = A033582(n) + n. - _Omar E. Pol_, Dec 22 2008 %F A092277 a(n) = a(n-1) + 14*n - 6 with n > 0, a(0)=0. - _Vincenzo Librandi_, Nov 17 2010 %F A092277 From _Elmo R. Oliveira_, Nov 29 2024: (Start) %F A092277 G.f.: 2*x*(4 + 3*x)/(1-x)^3. %F A092277 E.g.f.: exp(x)*x*(8 + 7*x). %F A092277 a(n) = 2*A022265(n). %F A092277 a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n > 2. (End) %e A092277 From _Bruno Berselli_, Oct 27 2017: (Start) %e A092277 After 0: %e A092277 8 = -(1) + (2+3+4). %e A092277 30 = -(1+2) + (3+4+5+6+7+8). %e A092277 66 = -(1+2+3) + (4+5+6+7+8+9+10+11+12). %e A092277 116 = -(1+2+3+4) + (5+6+7+8+9+10+11+12+13+14+15+16). (End) %o A092277 (PARI) a(n)=7*n^2+n \\ _Charles R Greathouse IV_, Jun 17 2017 %Y A092277 Cf. A000290, A033582. - _Omar E. Pol_, Dec 22 2008 %Y A092277 Cf. A022265, A219191. %K A092277 nonn,easy %O A092277 0,2 %A A092277 Evgeniy A. Chukhlomin (dkea(AT)yandex.ru), Feb 18 2004