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.

A147974 a(n) = n^3-((n-1)^3+(n-2)^3+(n-3)^3).

This page as a plain text file.
%I A147974 #17 Oct 09 2021 03:34:08
%S A147974 10,8,18,28,26,0,-62,-172,-342,-584,-910,-1332,-1862,-2512,-3294,
%T A147974 -4220,-5302,-6552,-7982,-9604,-11430,-13472,-15742,-18252,-21014,
%U A147974 -24040,-27342,-30932,-34822,-39024,-43550,-48412,-53622,-59192,-65134,-71460
%N A147974 a(n) = n^3-((n-1)^3+(n-2)^3+(n-3)^3).
%H A147974 Michael De Vlieger, <a href="/A147974/b147974.txt">Table of n, a(n) for n = 1..10000</a>
%H A147974 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4,-6,4,-1).
%F A147974 G.f.: -2*x*(18*x^3-23*x^2+16*x-5)/(x-1)^4. [_Colin Barker_, Oct 29 2012]
%t A147974 lst={};Do[k=n^3-((n-1)^3+(n-2)^3+(n-3)^3);AppendTo[lst,k],{n,5!}];lst
%o A147974 (Python)
%o A147974 def a(n): return n**3-((n-1)**3+(n-2)**3+(n-3)**3)
%o A147974 print([a(n) for n in range(1, 37)]) # _Michael S. Branicky_, Oct 08 2021
%Y A147974 Cf. A147973.
%K A147974 sign,easy
%O A147974 1,1
%A A147974 _Vladimir Joseph Stephan Orlovsky_, Nov 18 2008