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

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A074535 a(n) = 2^n + 4^n + 8^n. 2
3, 14, 84, 584, 4368, 33824, 266304, 2113664, 16843008, 134480384, 1074791424, 8594130944, 68736258048, 549822930944, 4398314962944, 35185445863424, 281479271743488, 2251816993685504, 18014467229220864, 144115462954287104 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

Number of monic irreducible polynomials of degree 1 in GF(2^n)[x,y,z]. - Max Alekseyev, Jan 23 2006

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..200

Index entries for linear recurrences with constant coefficients, signature (14,-56,64).

FORMULA

G.f.: 1/(1-2*x)+1/(1-4*x)+1/(1-8*x). E.g.f.: exp(2*x)+exp(4*x)+exp(8*x). [Mohammad K. Azarian, Dec 26 2008]

Let A=[1, 1, 1;2, 0, -2;1, -1, 1], the 3 X 3 Krawtchouk matrix. Then a(n)=trace((A*A')^n). - Paul Barry, Sep 18 2004

MATHEMATICA

Table[2^n + 4^n + 8^n, {n, 0, 20}]

PROG

(MAGMA) [2^n + 4^n + 8^n: n in [0..25]]; // Vincenzo Librandi, Jun 11 2011

CROSSREFS

Cf. A001550, A001576, A034513, A001579, A074501 - A074580.

Sequence in context: A220910 A121687 A154757 * A256337 A256330 A190761

Adjacent sequences:  A074532 A074533 A074534 * A074536 A074537 A074538

KEYWORD

easy,nonn

AUTHOR

Robert G. Wilson v, Aug 23 2002

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified November 9 01:23 EST 2017. Contains 294414 sequences.