Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A007476
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A007476 Shifts 2 places left under binomial transform.
(Formerly M1192)
+0
3
1, 1, 1, 2, 4, 9, 23, 65, 199, 654, 2296, 8569, 33825, 140581, 612933, 2795182, 13298464, 65852873, 338694479, 1805812309, 9963840219, 56807228074, 334192384460, 2026044619017, 12642938684817 (list; graph; listen)
OFFSET

0,4

COMMENT

Starting (1, 2, 4, 9, 23,...) = row sums of traingle A153859. [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Jan 02 2009]

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

T. D. Noe, Table of n, a(n) for n=0..100

M. Bernstein and N. J. A. Sloane, Some canonical sequences of integers, Linear Alg. Applications, 226-228 (1995), 57-72; erratum 320 (2000), 210.

A. Claesson and T. Mansour, Permutations avoiding a pair of generalized patterns....

N. J. A. Sloane, Transforms

L. Sze, OEIS conjecture 70

FORMULA

G.f.: Sum{k=0..inf, x^(2k)/[prod(m=0..k-1, 1-mx)*prod(m=0..k+1, 1-mx)]}.

PROGRAM

a(n)=if(n<2, 1, a(n-1)+sum(k=0, n-2, binomial(n-2, k)*a(k))) (from R. Stephan)

CROSSREFS

A153859 [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Jan 02 2009]

Sequence in context: A092668 A164039 A014137 this_sequence A129698 A117419 A124461

Adjacent sequences: A007473 A007474 A007475 this_sequence A007477 A007478 A007479

KEYWORD

nonn,nice

AUTHOR

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

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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research