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.

A017575 a(n) = (12n+4)^7.

This page as a plain text file.
%I A017575 #13 Dec 30 2024 22:44:21
%S A017575 16384,268435456,13492928512,163840000000,1028071702528,4398046511104,
%T A017575 14645194571776,40867559636992,100000000000000,221068140740608,
%U A017575 450766669594624,860542568759296,1555363874947072,2684354560000000,4453476124377088,7140436495826944,11112006825558016
%N A017575 a(n) = (12n+4)^7.
%H A017575 <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (8,-28,56,-70,56,-28,8,-1).
%F A017575 From _Amiram Eldar_, Jul 14 2024: (Start)
%F A017575 a(n) = A001015(A017569(n)) = A017569(n)^7.
%F A017575 a(n) = 16384 * A016783(n).
%F A017575 Sum_{n>=0} 1/a(n) = 7*Pi^7/(403107840*sqrt(3)) + 1093*zeta(7)/35831808. (End)
%t A017575 a[n_] := (12*n + 4)^7; Array[a, 20, 0] (* _Amiram Eldar_, Jul 14 2024 *)
%Y A017575 Cf. A001015, A013665, A016783, A017569.
%K A017575 nonn,easy
%O A017575 0,1
%A A017575 _N. J. A. Sloane_
%E A017575 More terms from _Amiram Eldar_, Jul 14 2024