Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A106408
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A106408 Triangle, read by rows, where T(1,1) = 1; T(2,2) = 2; for n>2 T(n,n) = T(n-1,n-1) + T(n-2,n-2); T(n+1,n) = 2 * T(n,n); for all other entries T(n,k) = T(n-1,k) + T(n-2,k). +0
2
1, 2, 2, 3, 4, 3, 5, 6, 6, 5, 8, 10, 9, 10, 8, 13, 16, 15, 15, 16, 13, 21, 26, 24, 25, 24, 26, 21, 34, 42, 39, 40, 40, 39, 42, 34, 55, 68, 63, 65, 64, 65, 63, 68, 55, 89, 110, 102, 105, 104, 104, 105, 102, 110, 89, 144, 178, 165, 170, 168, 169, 168, 170, 165, 178, 144 (list; graph; listen)
OFFSET

1,2

COMMENT

Row sums are A004798 (convolution of Fibonacci numbers 1,2,3,5,... with themselves). Central numbers of the rows are A006498 (a(n) = a(n-1)+a(n-3)+a(n-4)). First column and main diagonal are FIbonacci numbers 1,2,3,5,... First subdiagonal are 2*Fibonacci numbers. T(n,k) = F(n-k+2)*F(k+1) where F(m) is the m-th Fibonacci number. For the antidiagonal sums b(n): b(1) = 1, b(2) = 2, then b(n) = b(n-1) + b(n-2) + F(floor((n+3)/2)).

FORMULA

G.f.: (1+x+y+x*y)/((1-x-x^2)*(1-y-y^2)) [U coordinates] - njas, Jun 01 2005

CROSSREFS

Cf. A000045, A004798, A006498.

Sequence in context: A091524 A026350 A128282 this_sequence A096858 A037254 A071506

Adjacent sequences: A106405 A106406 A106407 this_sequence A106409 A106410 A106411

KEYWORD

nonn

AUTHOR

Gerald McGarvey (gerald.mcgarvey(AT)comcast.net), May 28 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 July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research