Search: id:A007476
Results 1-1 of 1 results found.

%I A007476 M1192
%S A007476 1,1,1,2,4,9,23,65,199,654,2296,8569,33825,140581,612933,
%T A007476 2795182,13298464,65852873,338694479,1805812309,9963840219,
%U A007476 56807228074,334192384460,2026044619017,12642938684817
%N A007476 Shifts 2 places left under binomial transform.
%C A007476 Starting (1, 2, 4, 9, 23,...) = row sums of traingle A153859. [From Gary 
               W. Adamson (qntmpkt(AT)yahoo.com), Jan 02 2009]
%D A007476 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%H A007476 T. D. Noe, <a href="b007476.txt">Table of n, a(n) for n=0..100</a>
%H A007476 M. Bernstein and N. J. A. Sloane, <a href="http://arXiv.org/abs/math.CO/
               0205301">Some canonical sequences of integers</a>, Linear Alg. Applications, 
               226-228 (1995), 57-72; erratum 320 (2000), 210.
%H A007476 A. Claesson and T. Mansour, <a href="http://www.arXiv.org/abs/math.CO/
               0107044">Permutations avoiding a pair of generalized patterns...</
               a>.
%H A007476 N. J. A. Sloane, <a href="transforms.txt">Transforms</a>
%H A007476 L. Sze, <a href="http://lsze.cosam.calpoly.edu/oeis70.pdf">OEIS conjecture 
               70</a>
%F A007476 G.f.: Sum{k=0..inf, x^(2k)/[prod(m=0..k-1, 1-mx)*prod(m=0..k+1, 1-mx)]}.
%o A007476 a(n)=if(n<2,1,a(n-1)+sum(k=0,n-2,binomial(n-2,k)*a(k))) (from R. Stephan)
%Y A007476 A153859 [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Jan 02 2009]
%Y A007476 Sequence in context: A092668 A164039 A014137 this_sequence A129698 A117419 
               A124461
%Y A007476 Adjacent sequences: A007473 A007474 A007475 this_sequence A007477 A007478 
               A007479
%K A007476 nonn,nice
%O A007476 0,4
%A A007476 N. J. A. Sloane (njas(AT)research.att.com).

Search completed in 0.001 seconds