cp's OEIS Frontend

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.

A276275 Padovan like sequence: a(n) = a(n-2) + a(n-3) for n>3, a(1)=2, a(2)=2, a(3)=0.

This page as a plain text file.
%I A276275 #34 Jan 27 2023 17:42:40
%S A276275 2,2,0,4,2,4,6,6,10,12,16,22,28,38,50,66,88,116,154,204,270,358,474,
%T A276275 628,832,1102,1460,1934,2562,3394,4496,5956,7890,10452,13846,18342,
%U A276275 24298,32188,42640,56486,74828,99126,131314,173954,230440,305268,404394,535708
%N A276275 Padovan like sequence: a(n) = a(n-2) + a(n-3) for n>3, a(1)=2, a(2)=2, a(3)=0.
%C A276275 Obtained from Padovan Spiral number (A134816) modulo 3 reduction periodic sequence 1112201210010, 111 112 122 220 ... fourth initialization values 220, it satisfies the same recurrence a(n) = a(n-2) + a(n-3).
%H A276275 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (0,1,1).
%F A276275 G.f.: 2*x*(1 + x - x^2)/(1 - x^2 - x^3).
%F A276275 a(n) = A134816(n) + A007307(n-3) for n>=4.
%F A276275 a(n) = 2*A084338(n-3) for n>=4.
%t A276275 RecurrenceTable[{a[n] == a[n - 2] + a[n - 3], a[1] == 2, a[2] == 2, a[3] == 0}, a, {n, 1, 48}] (* or *) CoefficientList[Series[2 x (1 + x - x^2)/(1 - x^2 - x^3), {x, 0, 47}], x] (* _Michael De Vlieger_, Sep 02 2016 *)
%t A276275 LinearRecurrence[{0,1,1},{2,2,0},60] (* _Harvey P. Dale_, Jan 27 2023 *)
%Y A276275 Cf. A134816, A084338.
%K A276275 nonn,easy
%O A276275 1,1
%A A276275 _Nicolas Bègue_, Aug 26 2016