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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049451 Twice second pentagonal numbers. 16
0, 4, 14, 30, 52, 80, 114, 154, 200, 252, 310, 374, 444, 520, 602, 690, 784, 884, 990, 1102, 1220, 1344, 1474, 1610, 1752, 1900, 2054, 2214, 2380, 2552, 2730, 2914, 3104, 3300, 3502, 3710, 3924, 4144, 4370, 4602, 4840, 5084, 5334, 5590, 5852 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Write 1,2,3,4,... in a hexagonal spiral around 0, then a(n) is the sequence found by reading the line from 0 in the direction 0,4,... - Floor van Lamoen (fvlamoen(AT)hotmail.com), Jul 21 2001. The spiral begins:

......16..15..14

....17..5...4...13

..18..6...0...3...12

19..7...1...2...11..26

..20..8...9...10..25

....21..22..23..24

Number of edges in the join of the complete bipartite graph of order 2n and the cycle graph of order n, K_n,n * C_n - Roberto E. Martinez II (remartin(AT)fas.harvard.edu), Jan 07 2002

The average of the first n elements starting from a(1) is equal to (n+1)^2. - Mario Catalani (mario.catalani(AT)unito.it), Apr 10 2003

If Y is a 4-subset of an n-set X then, for n>=4, a(n-4) is the number of (n-4)-subsets of X having either one element or two elements in common with Y. - Milan Janjic, Dec 28 2007

The maximum possible sum of numbers in an N x N standard Minesweeper grid. [From Dmitry Kamenetsky, Dec 14 2008]

a(n) = A001399(6n-2), number of partitions of 6*n-2 into parts <4. For example a(2)=14 where the partitions of 6*2-2=10 into parts <4 are [1,1,1,1,1,1,1,1,1,1] [1,1,1,1,1,1,1,1,2] [1,1,1,1,1,1,1,3], [1,1,1,1,1,1,2,2] [1,1,1,1,1,2,3][1,1,1,1,2,2,2] [1,1,1,1,3,3], [1,1,1,2,2,3], [1,1,2,2,2,2] [1,1,2,3,3] [1,2,2,2,3], [2,2,2,2,2] [1,3,3,3], [2,2,3,3]. - Adi Dani, Jun 07 2011

a(n) = A100104(n+1) - A100104(n). - Reinhard Zumkeller, Jul 07 2012

REFERENCES

L. B. W. Jolley, "Summation of Series", Dover Publications, 1961, p. 12.

LINKS

Table of n, a(n) for n=0..44.

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

FORMULA

a(n) = n*(3*n+1). G.f.: A(x) = 2*x*(2+x)/(1-x)^3.

sum{i=1..n} a(i) = A045991(n+1). - Gary W. Adamson, Dec 20 2006

a(n) = A005449(n)*2. [From Omar E. Pol, Dec 18 2008]

a(n)=6*n+a(n-1)-2, n>0. [From Vincenzo Librandi, Aug 06 2010]

a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) with a(0) = 0, a(1) = 4, a(2) = 14. - Philippe Deléham, Mar 26 2013

a(n) = A174709(6n+3). - Philippe Deléham, Mar 26 2013

EXAMPLE

Contribution from Dmitry Kamenetsky, Dec 14 2008, with slight rewording by Raymond Martineau (mart0258(AT)yahoo.com), Dec 16 2008: (Start)

For an N x N Minesweeper grid the highest sum of numbers is (N-1)(3*N-2). This is achieved by filling every second row with mines (shown as 'X'). For example, when N=5 the best grids are:

XXXXX

46664

XXXXX

46664

XXXXX

and

23332

XXXXX

46664

XXXXX

23332

Both giving a total of 52. (End)

a(1)=6*1+0-2=4; a(2)=6*2+4-2=14; a(3)=6*3+14-2=30 [From Vincenzo Librandi, Aug 06 2010]

MAPLE

a:=n->sum(2*(n+j), j=1..n): seq(a(n), n=0..44); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 26 2008

MATHEMATICA

s=0; lst={s}; Do[s+=n+++4; AppendTo[lst, s], {n, 0, 7!, 6}]; lst [From Vladimir Joseph Stephan Orlovsky, Nov 16 2008]

lst={}; Do[AppendTo[lst, (((n+1)^3)-((n+1)^2))-((n^3)-(n^2))], {n, 0, 5!}]; lst [From Vladimir Joseph Stephan Orlovsky, Mar 01 2009]

PROG

(Haskell)

a049451 n = n * (3 * n + 1)  -- Reinhard Zumkeller, Jul 07 2012

CROSSREFS

Cf. A000567, A005449, A033580, A049450.

Sequence in context: A130439 A033690 A103779 * A079776 A117109 A140063

Adjacent sequences:  A049448 A049449 A049450 * A049452 A049453 A049454

KEYWORD

nonn,easy

AUTHOR

Joe Keane (jgk(AT)jgk.org).

STATUS

approved

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 May 23 23:31 EDT 2013. Contains 225613 sequences.