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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A004171 2^(2n+1). 30
2, 8, 32, 128, 512, 2048, 8192, 32768, 131072, 524288, 2097152, 8388608, 33554432, 134217728, 536870912, 2147483648, 8589934592, 34359738368, 137438953472, 549755813888, 2199023255552, 8796093022208, 35184372088832, 140737488355328, 562949953421312 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

COMMENTS

Same as Pisot sequences E(2,8), L(2,8), P(2,8), T(2,8). See A008776 for definitions of Pisot sequences.

In the Chebyshev polynomial of degree 2n, a(n) is the coefficient of x^2n. - Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 13 2002

1/2 - 1/8 + 1/32 - 1/128 + ... = 2/5 [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Mar 03 2009]

Numbers n such that n^3+(n/2)^3=9*n^3/8 is a square. [From Vincenzo Librandi, Nov 18 2010]

From Adi Dani, May 15 2011: (Start)

Number of ways of placing an even number of undistinguishable objects in n+1 distinguishable boxes with at most 3 objects in box.

Number of compositions of even natural numbers into n+1 parts <=3 (0 is counted as part). (End)

REFERENCES

Adi Dani, Quasicompositions of natural numbers, Proceedings of III congress of mathematicians of Macedonia, Struga Macedonia 29 IX -2 X 2005 pages 225-238

LINKS

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

Index entries for sequences related to linear recurrences with constant coefficients

Milan Janjic, Enumerative Formulas for Some Functions on Finite Sets

Tanya Khovanova, Recursive Sequences

FORMULA

a(n) = 2*4^n; a(n) = 4a(n-1).

1 = 1/2 + Sum(n = 1 through infinity) 3/a(n) = 3/6 + 3/8 + 3/32 + 3/128 + 3/512 + 3/2048...; with partial sums: 1/2, 31/32, 127/128, 511/512, 2047/2048... - Gary W. Adamson (qntmpkt(AT)yahoo.com), Jun 16 2003

a(n)=2*A000302(n) . G.f.: 2/(1-4*x). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 23 2008]

a(n) = A081294(n+1) = A028403(n+1) - A000079(n+1) for n >=1. a(n-1) = A028403(n) - A000079(n). [From Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), Jul 27 2009]

EXAMPLE

From Adi Dani, May 15 2011: (Start)

a(1)=8 because all compositions of even natural numbers into 2 parts <=3 are

for 0: (0,0)

for 2: (0,2),(2,0),(1,1)

for 4: (1,3),(3,1),(2,2)

for 6: (3,3).

a(2)=32 because all compositions of even natural numbers into 3 parts <=3 are

for 0: (0,0,0)

for 2: (0,0,2), (0,2,0), (2,0,0), (0,1,1), (1,0,1) , (1,1,0)

for 4: (0,1,3), (0,3,1), (1,0,3), (1,3,0), (3,0,1), (3,1,0), (0,2,2), (2,0,2), (2,2,0), (1,1,2), (1,2,1),  (2,1,1)

for 6: (0,3,3), (3,0,3), (3,3,0), (1,2,3), (1,3,2), (2,1,3), (2,3,1), (3,1,2), (3,2,1), (2,2,2)

for 8: (2,3,3), (3,2,3), (3,3,2).

(End)

MAPLE

seq(2^(2*n+1), n=0..24); # Nathaniel Johnston, Jun 25 2011

MATHEMATICA

Table[2^(2n + 1), {n, 0, 24}]

PROG

(MAGMA) [2^(2*n+1): n in [0..30]]; // Vincenzo Librandi, May 16 2011

CROSSREFS

Cf. A013708-A013729.

Absolute value of A009117. Essentially the same as A081294.

  Cf. A164632. Equals A000980(n) + 2*A181765(n). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 23 2009]

Sequence in context: A099752 A081294 * A009117 A160637 A183895 A150829

Adjacent sequences:  A004168 A004169 A004170 * A004172 A004173 A004174

KEYWORD

easy,nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 14:50 EST 2012. Contains 206050 sequences.