Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082652
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A082652 Triangle read by rows: T(l,c) = number of squares that can be found in a c X l rectangular grid of little squares, for 1 <= c <= l. +0
5
1, 2, 5, 3, 8, 14, 4, 11, 20, 30, 5, 14, 26, 40, 55, 6, 17, 32, 50, 70, 91, 7, 20, 38, 60, 85, 112, 140, 8, 23, 44, 70, 100, 133, 168, 204, 9, 26, 50, 80, 115, 154, 196, 240, 285, 10, 29, 56, 90, 130, 175, 224, 276, 330, 385, 11, 32, 62, 100, 145, 196, 252, 312, 375, 440 (list; table; graph; listen)
OFFSET

1,2

COMMENT

T(l,c) also is the total number of balls in a pyramid of balls on an l X c rectangular base. - N. J. A. Sloane (njas(AT)research.att.com), Nov 17 2007. For example, if the base is 4 X 2, the total number of balls is 4*2 + 3*1 = 11 = T(4,2).

1

2 5

3 8 14

4 11 20 30

5 14 26 40 55

6 17 32 50 70 91

7 20 38 60 85 112 140

FORMULA

T(l, c) = ( c + 3*c*l + 3*c^2*l - c^3 ) / 6

T(l, c) = Sum{ i = 0..min(l,c)} (l-i)*(c-i). - N. J. A. Sloane (njas(AT)research.att.com), Nov 17, 2007

EXAMPLE

Let X represent a small square. Then T(3,2) = 8 because here

XXX

XXX

we can see 8 squares, 6 of side 1, 2 of side 2.

MAPLE

f:=proc(m, n) add((m-i)*(n-i), i=0..min(m, n)); end;

CROSSREFS

Cf. A083003, A083487. Right side of triangle gives A000330.

Main diagonal is A000330, row sums are A001296. - Paul D. Hanna (pauldhanna(AT)juno.com) and other correspondents, May 28, 2003

Sequence in context: A050171 A136189 A081146 this_sequence A065222 A159988 A134880

Adjacent sequences: A082649 A082650 A082651 this_sequence A082653 A082654 A082655

KEYWORD

nonn,tabl

AUTHOR

Artemario Tadeu Medeiros da Silva (artemario(AT)uol.com.br), May 16 2003

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 7 23:45 EST 2009. Contains 170430 sequences.


AT&T Labs Research