Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A121896
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A121896 Let M be the matrix defined in A111490. Sequence gives M(1,1), M(1,2)+M(1,2)+M(2,2), M(1,3)+M(2,3)+M(3,1)+M(3,2)+M(3,3), etc. +0
2
1, 4, 8, 14, 20, 30, 37, 51, 61, 76, 89, 111, 120, 146, 165, 187, 205, 239, 255, 293, 312 (list; graph; listen)
OFFSET

1,2

FORMULA

a(n) = Sum_{i=1..n} M(i,n) + M(n,i) - M(n,n)

EXAMPLE

a(4)= 1+2+1+1+2+3+4 = 14

CROSSREFS

Sequence in context: A066941 A049420 A055507 this_sequence A131937 A088804 A027924

Adjacent sequences: A121893 A121894 A121895 this_sequence A121897 A121898 A121899

KEYWORD

easy,nonn

AUTHOR

Paolo P. Lava and Giorgio Balzarotti (ppl(AT)spl.at), Sep 01 2006

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 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research