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 A047915 #12 Dec 14 2024 12:10:25
%S A047915 6,7,14,27,46,71,102,139,182,231,286,347,414,487,566,651,742,839,942,
%T A047915 1051,1166,1287,1414,1547,1686,1831,1982,2139,2302,2471,2646,2827,
%U A047915 3014,3207,3406,3611,3822,4039,4262,4491,4726,4967,5214,5467,5726,5991,6262,6539
%N A047915 3*n^2-2*n+6.
%C A047915 The old entry with this sequence number was a duplicate of A010581.
%H A047915 Harvey P. Dale, <a href="/A047915/b047915.txt">Table of n, a(n) for n = 0..1000</a>
%H A047915 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (3,-3,1).
%F A047915 G.f.: (6-11x+11x^2)/(1-x)^3. Binomial transform of 6,1,6,0,0,.. (0 continued). - _R. J. Mathar_, Sep 29 2008
%t A047915 Table[3n^2-2n+6,{n,0,50}] (* or *) LinearRecurrence[{3,-3,1},{6,7,14},50] (* _Harvey P. Dale_, Dec 14 2024 *)
%o A047915 (PARI) a(n)=3*n^2-2*n+6 \\ _Charles R Greathouse IV_, Jun 17 2017
%K A047915 nonn,easy
%O A047915 0,1
%A A047915 Steven Weintraub (mooncalf_(AT)yahoo.com), Sep 24 2008