login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A027170 Triangular array T read by rows (4-diamondization of Pascal's triangle). Step 1: t(n,k)=C(n+2,k+1)+C(n+1,k)+C(n+1,k+1)+C(n,k). Step 2: T(n,k)=t(n,k)-t(0,0)+1. Domain: 0<=k<=n, n >= 0. 14
1, 3, 3, 5, 10, 5, 7, 19, 19, 7, 9, 30, 42, 30, 9, 11, 43, 76, 76, 43, 11, 13, 58, 123, 156, 123, 58, 13, 15, 75, 185, 283, 283, 185, 75, 15, 17, 94, 264, 472, 570, 472, 264, 94, 17, 19, 115, 362, 740, 1046, 1046, 740, 362, 115, 19, 21 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..56.

CROSSREFS

Sequence in context: A146926 A000198 A202674 * A132775 A174102 A217521

Adjacent sequences:  A027167 A027168 A027169 * A027171 A027172 A027173

KEYWORD

nonn,tabl

AUTHOR

Clark Kimberling

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 .

Last modified May 25 20:22 EDT 2013. Contains 225649 sequences.