Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A057566
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A057566 Number of collinear triples in a 3 X n rectangular grid. +0
1
0, 1, 2, 8, 20, 43, 78, 130, 200, 293, 410, 556, 732, 943, 1190, 1478, 1808, 2185, 2610, 3088, 3620, 4211, 4862, 5578, 6360, 7213, 8138, 9140, 10220, 11383, 12630, 13966, 15392, 16913, 18530, 20248, 22068, 23995, 26030, 28178, 30440, 32821, 35322 (list; graph; listen)
OFFSET

0,3

FORMULA

Conjecture: a(n)=5Floor[(2n^3-3n^2-n)/24]+Floor[(2(n-1)^3-3(n-1)^2-(n-1))/24]+n, which fits all of the listed terms.

a(n)=a(n-1)+b(n), with a(0)=-2, b(0)=8 and being b(n)=b(n-1)-7+Sum_{k=0..n}{5*(k mod 2)+[(k+1) mod 2]} - Paolo P. Lava (ppl(AT)spl.at), Aug 24 2007

MAPLE

P:=proc(n) local a, b, i; b:=8; a:=-2; for i from 0 by 1 to n do b:=b-7+sum('(5*(k mod 2)+((k+1) mod 2))', 'k'=0..i); a:=a+b; print(a); od; end: P(200); - Paolo P. Lava (ppl(AT)spl.at), Aug 24 2007

CROSSREFS

Second differences give A047264. Third differences are periodic {5, 1, 5, 1, ...} and form A010686. See A000938 for the n X n grid.

Sequence in context: A058037 A048096 A072250 this_sequence A009303 A096586 A165751

Adjacent sequences: A057563 A057564 A057565 this_sequence A057567 A057568 A057569

KEYWORD

nonn

AUTHOR

John W. Layman (layman(AT)math.vt.edu), Oct 04 2000

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 25 13:47 EST 2009. Contains 167481 sequences.


AT&T Labs Research