login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A028400 a(n) = (2^n + 1)^2. 7
4, 9, 25, 81, 289, 1089, 4225, 16641, 66049, 263169, 1050625, 4198401, 16785409, 67125249, 268468225, 1073807361, 4295098369, 17180131329, 68720001025, 274878955521, 1099513724929, 4398050705409, 17592194433025 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

Table of n, a(n) for n=0..22.

H. Bottomley, Illustration of initial terms

I. Strazdins, Universal affine classification of Boolean functions, Acta Applic. Math. 46 (1997), 147-167.

Index entries for linear recurrences with constant coefficients, signature (7,-14,8).

FORMULA

a(n) = A000051(n)^2. - R. J. Mathar, Nov 27 2015

G.f.: ( -4+19*x-18*x^2 ) / ( (x-1)*(2*x-1)*(4*x-1) ). - R. J. Mathar, Nov 27 2015

PROG

(PARI) a(n)=(2^n + 1)^2

CROSSREFS

Sequence in context: A304167 A317975 A307396 * A237613 A220444 A117678

Adjacent sequences:  A028397 A028398 A028399 * A028401 A028402 A028403

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane.

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 15 03:30 EDT 2019. Contains 328025 sequences. (Running on oeis4.)