This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A026552 Triangular array T read by rows: T(i,0)=T(i,2i)=1 for i >= 0, T(i,1)=T(i,2i-1)=[ i/2 + 1 ] for i >= 1, for even n >= 2, T(i,j)=T(i-1,j-2)+T(i-1,j-1)+T(i-1,j) for 2<=j<=2i-2, for odd n >= 3, T(i,j)=T(i-1,j-2)+T(i-1,j) for 2<=j<=2i-2. 20
 1, 1, 1, 1, 1, 2, 3, 2, 1, 1, 2, 4, 4, 4, 2, 1, 1, 3, 7, 10, 12, 10, 7, 3, 1, 1, 3, 8, 13, 19, 20, 19, 13, 8, 3, 1, 1, 4, 12, 24, 40, 52, 58, 52, 40, 24, 12, 4, 1, 1, 4, 13, 28, 52, 76, 98, 104, 98, 76, 52, 28, 13, 4, 1, 1, 5, 18, 45, 93, 156, 226, 278 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 LINKS FORMULA T(n, k) = number of integer strings s(0), ..., s(n) such that s(0)=0, s(n)=n-k, |s(i)-s(i-1)|<=1 if i is even or i=1, |s(i)-s(i-1)|=1 if i is odd and >=3. CROSSREFS Sequence in context: A105734 A076839 A092542 * A208233 A176270 A086437 Adjacent sequences:  A026549 A026550 A026551 * A026553 A026554 A026555 KEYWORD nonn,tabl AUTHOR STATUS approved

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 .