Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A102322
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A102322 Column 1 of triangular matrix A102320, which that satisfies: T(n,k) = [T^2](n-1,k) when n>k>=0, with T(n,n) = (2*n+1). +0
2
0, 3, 9, 72, 945, 17568, 427770, 12979080, 473981445, 20308813128, 1001231706582, 55927084380552, 3495759750651978, 242012640619081152, 18398411206663695732, 1524754064472700613328, 136890662566189661556525 (list; graph; listen)
OFFSET

0,2

PROGRAM

(PARI) {a(n)=local(A=Mat([1, 0; 1, 1]), B); for(m=2, n+1, B=matrix(m, m); for(i=1, m, for(j=1, i, if(j==i, B[i, j]=2*j-1, if(j==1, B[i, j]=(A^2)[i-1, 1], B[i, j]=(A^2)[i-1, j])); )); A=B); return(A[n+1, 2])}

CROSSREFS

Cf. A102087, A102320.

Sequence in context: A084543 A018564 A004167 this_sequence A018576 A027290 A131496

Adjacent sequences: A102319 A102320 A102321 this_sequence A102323 A102324 A102325

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Jan 05 2005

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 November 30 22:12 EST 2008. Contains 150989 sequences.


AT&T Labs Research