Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A104445
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A104445 Triangular matrix T, read by rows, that satisfies: SHIFT_LEFT_UP(T) = T^2 - T + I, or, equivalently: T(n+1,k+1) = [T^2](n,k) - T(n,k) + [T^0](n,k) for n>=k>=0, with T(0,0)=1. +0
5
1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 4, 3, 1, 1, 1, 9, 9, 4, 1, 1, 1, 24, 30, 16, 5, 1, 1, 1, 77, 115, 70, 25, 6, 1, 1, 1, 295, 510, 344, 135, 36, 7, 1, 1, 1, 1329, 2602, 1908, 805, 231, 49, 8, 1, 1, 1, 6934, 15133, 11904, 5325, 1616, 364, 64, 9, 1, 1, 1, 41351, 99367, 83028, 39001 (list; table; graph; listen)
page 1

Search completed in 0.002 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 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research