login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A051890 2*(n^2-n+1). 27
2, 2, 6, 14, 26, 42, 62, 86, 114, 146, 182, 222, 266, 314, 366, 422, 482, 546, 614, 686, 762, 842, 926, 1014, 1106, 1202, 1302, 1406, 1514, 1626, 1742, 1862, 1986, 2114, 2246, 2382, 2522, 2666, 2814, 2966, 3122, 3282, 3446, 3614, 3786, 3962 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

COMMENTS

Draw n ellipses in the plane (n>0), any 2 meeting in 4 points; sequence gives number of regions into which the plane is divided.

Least k such that Z(k,2) <= Z(n,3) where Z(m,s) = sum(i>=m, 1/i^s) = zeta(s)-sum(i=1,m-1,1/i^s). - Benoit Cloitre (benoit7848c(AT)orange.fr), Nov 29 2002

For n>2, third diagonal of [A154685] [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Aug 06 2010]

a(n) is also the Moore lower bound on the order of an (n,6)-cage. - Jason Kimberley, Oct 17 2011

REFERENCES

Parabola, vol. 20, no. 2, 1984, p. 27, Problem #Q607.

J. V. Post, "When Centered Polygonal Numbers are Perfect Squares" preprint.

LINKS

Parabola, Web site

Eric Weisstein's World of Mathematics, Plane Division by Ellipses

Index to sequences with linear recurrences with constant coefficients, signature (3,-3,1).

FORMULA

a(n) = 4*binomial(n, 2)+2. - Francois Jooste (phukraut(AT)hotmail.com), Mar 05 2003

For n>2 nearest integer to sum(k>=n, 1/k^3)/sum(k>=n, 1/k^5) - Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 12 2003

a(n) = 2*A002061(n). - Jonathan Vos Post (jvospost3(AT)gmail.com), Jun 19 2005

a(n) = 4*n+a(n-1)-4 (with a(0)=2) [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Aug 06 2010]

a(n) = 2*(n^2-n+1) = 2(n-1)^2 + 2(n-1) + 2 = 222 read in base n-1 (for n>3). - Jason Kimberley, Oct 20 2011

G.f.: 2*(1-2*x+3*x^2)/(1-x)^3. [Colin Barker, Jan 10 2012]

EXAMPLE

a(1)=4*1+2-4=2; a(2)=4*2+2-4=6; a(3)=4*3+6-4=14 [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Aug 06 2010]

MAPLE

A051890 := n->2*(n^2-n+1);

MATHEMATICA

a=2; lst={}; Do[a+=n; AppendTo[lst, a], {n, 0, 6!, 4}]; lst...and/or... lst={}; Do[AppendTo[lst, 2*(n^2-n+1)], {n, 5!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Mar 01 2009]

CROSSREFS

Cf. A001844, A002061, A014206, A002061.

Cf. A154685 [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Jan 25 2009]

Moore lower bound on the order of a (k,g) cage: A198300 (square); rows: A000027 (k=2), A027383 (k=3), A062318 (k=4), A061547 (k=5), A198306 (k=6), A198307 (k=7), A198308 (k=8), A198309 (k=9), A198310 (k=10), A094626 (k=11); columns: A020725 (g=3), A005843 (g=4), A002522 (g=5), this sequence (g=6), A188377 (g=7). - Jason Kimberley, Oct 30 2011

Sequence in context: A049952 A019100 A019101 * A071109 A005310 A002203

Adjacent sequences:  A051887 A051888 A051889 * A051891 A051892 A051893

KEYWORD

nonn,easy

AUTHOR

Antreas P. Hatzipolakis (xpolakis(AT)otenet.gr), Apr 30 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 18:09 EST 2012. Contains 205663 sequences.