This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A161380 Triangle read by rows: T(n,k) = 2*k*T(n-1,n-1) + 1 (n >= 0, 0 <= k <= n), with T(0,0) = 1. 2
 1, 1, 3, 1, 7, 13, 1, 27, 53, 79, 1, 159, 317, 475, 633, 1, 1267, 2533, 3799, 5065, 6331, 1, 12663, 25325, 37987, 50649, 63311, 75973, 1, 151947, 303893, 455839, 607785, 759731, 911677, 1063623, 1, 2127247, 4254493, 6381739, 8508985, 10636231 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Nathaniel Johnston, Table of n, a(n) for n = 0..2500 Mathieu Guay-Paquet and _Jeffrey Shallit_, Avoiding Squares and Overlaps Over the Natural Numbers. Discrete Math., 309 (2009), 6245-6254. EXAMPLE Triangle begins: 1 1 3 1 7    13 1 27   53   79 1 159  317  475  633 1 1267 2533 3799 5065 6331 MAPLE T := proc(n, k) option remember: if(n=0 and k=0)then return 1: else return 2*k*T(n-1, n-1)+1: fi: end: for n from 0 to 8 do for k from 0 to n do printf("%d, ", T(n, k)): od: od: # Nathaniel Johnston, Apr 26 2011 CROSSREFS Diagonal gives A010844. Column 2 is A161370. Sequence in context: A196845 A218592 A113647 * A051927 A194595 A219063 Adjacent sequences:  A161377 A161378 A161379 * A161381 A161382 A161383 KEYWORD nonn,tabl,easy AUTHOR N. J. A. Sloane, Nov 28 2009 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 22 16:56 EDT 2013. Contains 225553 sequences.