Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A027306
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A027306 2^(n - 1) + (1 + ( - 1)^n)/4*binomial(n, n/2). +0
7
1, 1, 3, 4, 11, 16, 42, 64, 163, 256, 638, 1024, 2510, 4096, 9908, 16384, 39203, 65536, 155382, 262144, 616666, 1048576, 2449868, 4194304, 9740686, 16777216, 38754732, 67108864, 154276028, 268435456, 614429672, 1073741824, 2448023843 (list; graph; listen)
OFFSET

0,3

COMMENT

Equals Sum_{k=0..[n/2]} C(n,k).

Inverse binomial transform of A027914 . Hankel transform (see A001906 for definition) is {1, 2, 3, 4, ..., n, ...} . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Jul 21 2005

REFERENCES

A. P. Prudnikov, Yu. A. Brychkov and O.I. Marichev, "Integrals and Series", Volume 1: "Elementary Functions", Chapter 4: "Finite Sums", New York, Gordon and Breach Science Publishers, 1986-1992, Eq. (4.2.1.6)

LINKS

Y. Puri and T. Ward, Arithmetic and growth of periodic orbits, J. Integer Seqs., Vol. 4 (2001), #01.2.1.

FORMULA

Odd terms are 2^(n-1). Also a(2n) - 2^(2n-1) is given by A001700. a(n) = 2^n+mod(n, 2)*C(n, (n-1)/2).

E.g.f.: (exp(2x)+I_0(2x))/2.

O.g.f.: 2*x/(1-2*x)/(1+2*x-((1+2*x)*(1-2*x))^(1/2)). - Vladeta Jovovic (vladeta(AT)eunet.rs), Apr 27 2003

MAPLE

restart:a:= proc(n) option remember; if n=0 then 1 else add(binomial (n, j), j=0..n/2) fi end: seq (a(n), n=0..32); # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 29 2009]

MATHEMATICA

Table[Sum[Binomial[n, k], {k, 0, Floor[n/2]}], {n, 1, 35}]

PROGRAM

(PARI) a(n)=if(n<0, 0, (2^n+if(n%2, 0, binomial(n, n/2)))/2)

CROSSREFS

a(n) = Sum{(k+1)T(n, m-k)}, 0<=k<=[ (n+1)/2 ], T given by A008315.

Sequence in context: A001641 A007382 A127804 this_sequence A026676 A142870 A143680

Adjacent sequences: A027303 A027304 A027305 this_sequence A027307 A027308 A027309

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

EXTENSIONS

Better description from Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 30 2000 and from Yong Kong (ykong(AT)curagen.com), Dec 28 2000

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research