Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026270
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A026270
%S A026270 1,2,6,15,39,102,270,721,1941,5262,14354,39372,108528,300482,835278,2330334,
%T A026270 6522882,18313542,51559506,145530291,411738723,1167450066,3316925794,
%U A026270 9441771081,26923831029,76901809810,219992462862,630245628681,1808029517585
%N A026270 Number of (s(0), s(1), ..., s(n)) such that every s(i) is a nonnegative 
               integer, s(0) = 0, s(1) = 1 = s(n), |s(i) - s(i-1)| <= 1 for i >= 
               2, |s(2) - s(1)| = 1, |s(3) - s(2)| = 1 if s(2) = 1. Also T(n,n-1), 
               where T is the array in A026268.
%F A026270 G.f.: -1 + 4z^2(1-z)(1-z^2)/[1-z+sqrt(1-2z-3z^2)]^2.
%Y A026270 First differences of A026269. Pairwise sums of A026122.
%Y A026270 Sequence in context: A094969 A001674 A121331 this_sequence A001654 A062106 
               A061322
%Y A026270 Adjacent sequences: A026267 A026268 A026269 this_sequence A026271 A026272 
               A026273
%K A026270 nonn
%O A026270 2,2
%A A026270 Clark Kimberling (ck6(AT)evansville.edu)

    
page 1

Search completed in 0.001 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 December 21 10:15 EST 2009. Contains 171081 sequences.


AT&T Labs Research