|
| |
|
|
A001318
|
|
Generalized pentagonal numbers: n*(3*n-1)/2, n=0, +- 1, +- 2,....
(Formerly M1336 N0511)
|
|
119
| |
|
|
0, 1, 2, 5, 7, 12, 15, 22, 26, 35, 40, 51, 57, 70, 77, 92, 100, 117, 126, 145, 155, 176, 187, 210, 222, 247, 260, 287, 301, 330, 345, 376, 392, 425, 442, 477, 495, 532, 551, 590, 610, 651, 672, 715, 737, 782, 805, 852, 876, 925, 950, 1001, 1027, 1080, 1107, 1162, 1190, 1247, 1276, 1335
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
COMMENTS
| First differences give A026741 [Jud McCranie].
Comment from R. K. Guy, Dec 28 2005: (Start)
"Conway's relation twixt the triangular and pentagonal numbers: Divide the triangular numbers by 3 (when you can exactly):
0 1 3 6 10 15 21 28 36 45 55 66 78 91 105 120 136 153 ...
0 - 1 2 .- .5 .7 .- 12 15 .- 22 26 .- .35 .40 .- ..51 ...
.....-.-.....+..+.....-..-.....+..+......-...-.......+....
"and you get the pentagonal numbers in pairs, one of positive rank and the other negative.
"Append signs according as the pair have the same (+) or opposite (-) parity.
"Then Euler's pentagonal number theorem is easy to remember:
"p(n-0)-p(n-1)-p(n-2)+p(n-5)+p(n-7)-p(n-12)-p(n-15)++-- =0^n
where p(n) is the partition function, the left side terminates before the argument becomes negative and 0^n = 1 if n = 0 and = 0 if n > 0.
"E.g. p(0)=1, p(7)=p(7-1)+p(7-2)-p(7-5)-p(7-7)+0^7=11+7-2-1+0=15."
(End)
Sequence that may be used in order to compute sigma(n), as described in Euler's article. - Thomas Baruchel (baruchel(AT)users.sourceforge.net), Nov 19 2003
Number of levels in the partitions of n+1 with parts in {1,2}.
A080995(a(n))=1: complement of A090864; A000009(a(n))=A051044(n). - Reinhard Zumkeller, Apr 22 2006
a(n) is the number of 3 X 3 matrix (symmetrical about each diagonal) M=[a,b,c;b,d,b;c,b,a] such that a+b+c=b+d+b=n+2, a,b,c,d natural numbers; example : a(3)=5 because (a,b,c,d)=(2,2,1,1), (1,2,2,1), (1,1,3,3), (3,1,1,3), (2,1,2,3). - Philippe DELEHAM, Apr 11 2007
Also numbers a(n) such that 24*a(n)+1=(6*n-1)^2 are odd squares: 1, 25, 49, 121, 169, 289, 361,..., n=0, +-1, +-2,.... - Zak Seidov, Mar 08 2008
Contribution from Matthew Vandermast, Oct 28 2008: (Start)
Numbers n for which A000326(n) is a member of A000332. Cf. A145920.
This sequence contains all members of A000332 and all nonnegative members of A145919. For values of n such that n*(3*n-1)/2 belongs to A000332, see A145919. (End)
Starting with offset 1 = row sums of triangle A168258 [From Gary W. Adamson, Nov 21 2009]
Starting with offset 1 = Triangle A101688 * [1, 2, 3,...] [From Gary W. Adamson, Nov 27 2009]
Starting with offset 1 can be considered the first in an infinite set generated from A026741. Refer to the array in A175005. [Gary W. Adamson, Apr 03 2010]
Vertex number of a square spiral whose edges have length A026741. The two axes of the spiral forming an "X" are A000326 and A005449. The four semi-axes forming an "X" are A049452, A049453, A033570 and the numbers >= 2 of A033568. - Omar E. Pol, Sep 08 2011
A general formula for the generalized k-gonal numbers is given by n*((k-2)*n-k+4)/2, n=0, +- 1, +- 2,..., k>=5. - Omar E. Pol, Sep 15 2011
|
|
|
REFERENCES
| Cooper, S. and Hirschhorn, M. D., Results of Hurwitz type for three squares. Discrete Math. 274 (2004), no. 1-3, 9-24. See P(q).
L. Euler, Decouverte d'une loi tout extraordinaire des nombres par rapport a la somme de leurs diviseurs, Opera Omnia, I, 2, pp. 241-253.
A. Fink, R. K. Guy and M. Krusemeyer, Partitions with parts occurring at most thrice, Contrib. Discr. Math. 3 (2) (2008), 76-114
E. Haga, A strange sequence and a brilliant discovery, chapter 5 of Exploring prime numbers on your PC and the Internet, first revised ed., 2007 (and earlier ed.), pp. 53-70.
R. Honsberger, Ingenuity in Math., Random House, 1970, p. 117.
D. E. Knuth, The Art of Computer Programming, vol. 4A, Combinatorial Algorithms, (to appear), section 7.2.1.4, equation (18).
I. Niven, Formal power series, Amer. Math. Monthly, 76 (1969), 871-889.
I. Niven and H. S. Zuckerman, An Introduction to the Theory of Numbers. 2nd ed., Wiley, NY, 1966, p. 231.
S. C. Schlicker, Numbers Simultaneously Polygonal and Centered Polygonal, Mathematics Magazine, Vol. 84, No. 5, December 2011
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
A. Weil, Two lectures on number theory, past and present, L'Enseign. Math., XX (1974), 87-110; Oeuvres III, 279-302.
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n = 0..1000
L. Euler, On the remarkable properties of the pentagonal numbers
L. Euler, De mirabilibus proprietatibus numerorum pentagonalium, par. 2
L. Euler, Observatio de summis divisorum p. 8.
L. Euler, An observation on the sums of divisors p. 8.
S. Heubach and T. Mansour, Counting rises, levels and drops in compositions
Alfred Hoehn, Illustration of initial terms
B. H. Margolius, Permutations with inversions, J. Integ. Seqs. Vol. 4 (2001), #01.2.4.
J. W. Meijer and M. Nepveu, Euler's ship on the Pentagonal Sea, Acta Nova, Volume 4, No.1, December 2008. pp. 176-187. [From Johannes W. Meijer, June 21, 2010]
S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
S. Plouffe, 1031 Generating Functions and Conjectures, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
Eric Weisstein's World of Mathematics, Pentagonal numbers, Partition Function P.
M. Wohlgemuth, Pentagon, Kartenhaus und Summenzerlegung
Eric Weisstein's World of Mathematics, Pentagonal Number Theorem
Index entries for sequences related to linear recurrences with constant coefficients, signature (1,2,-2,-1,1).
|
|
|
FORMULA
| Euler: prod(n>=1, 1-x^n ) = sum(n = -inf..inf, (-1)^n*x^(n*(3*n-1)/2) ).
Euler transform of length 3 sequence [ 2, 2, -1]. - Michael Somos, Mar 24 2011
a(-1 - n) = a(n). a(2*n) = A005449(n). a(2*n - 1) = A000326(n). - Michael Somos, Mar 24 2011
a(n) = 3+2*a(n-2)-a(n-4). [Ant King, 23 Aug 2011]
Product_{k>0} (1 - x^k) = Sum_{k>=0} (-1)^k * x^a(k). - Michael Somos Mar 24 2011
G.f.: x*(1+x+x^2)/ ( (1+x)^2*(1-x)^3 ).
a(n) = n*(n+1)/6 when n runs through numbers == 0 or 2 mod 3 - Barry E. Williams
a(n) = A008805(n-1) + A008805(n-2) + A008805(n-3), n>2. - Ralf Stephan, Apr 26 2003
Sequence consists of the pentagonal numbers (A000326), followed by A000326(n)+n and then the next pentagonal numbers. - Jon Perry, Sep 11 2003
a(n)=(6*n^2+6*n+1)/16-(2*n+1)*(-1)^n/16; a(n)=A034828(n+1)-A034828(n). - Paul Barry, May 13 2005
a(n)=sum{k=1..floor((n+1)/2), n-k+1} - Paul Barry, Sep 07 2005
a(n)=A000217(n)-A000217(floor(n/2)). - Pierre CAMI, Dec 09 2007
If n even a(n)=a(n-1)+n/2 and if n odd a(n)=a(n-1)+n, n>=2. - Pierre CAMI, Dec 09 2007
a(n)-a(n-1) = A026741(n) and it follows that the difference between consecutive terms is equal to n if n is odd and to n/2 if n is even. Hence this is a self-generating sequence that can be simply constructed from knowledge of the first term alone. - Ant King, Sep 26 2011
|
|
|
MAPLE
| A001318:=-(1+z+z**2)/(z+1)**2/(z-1)**3; [S. Plouffe in his 1992 dissertation. Gives sequence without initial zero.]
A001318 := proc(n) (6*n^2+6*n+1)/16-(2*n+1)*(-1)^n/16 ; end proc: # R. J. Mathar, Mar 27 2011
|
|
|
MATHEMATICA
| Table[n*(n+1)/6, {n, Select[Range[0, 100], Mod[#, 3] != 1 &]}]
|
|
|
PROG
| (PARI) {a(n) = (3*n^2 + 2*n + (n%2) * (2*n + 1)) / 8} /* Michael Somos, Mar 24
2011 */
(PARI) {a(n) = if( n<0, 0, polcoeff( x * (1 - x^3) / ((1 - x) * (1-x^2))^2 + x * O(x^n), n))} /* Michael Somos Mar, 24 2011 */
|
|
|
CROSSREFS
| A080995 is the charactersitic function; see also A010815.
Cf. A000326 (pentagonal numbers), A000217 (triangular numbers), A034828, A005449.
Indices of nonzero terms of A010815 [David W. Wilson], i.e. the (zero-based) indices of 1-bits of the infinite binary word to which the terms of A068052 converge.
Union of A036498 and A036499.
Cf. A153384.
Cf. A074378, A057569, A057570. [From Vladimir Orlovsky, Jan 06 2009]
Cf. A168258, A101688, A174739, A175005.
Sequence in context: A129232 A088822 A080182 * A024702 A161664 A080547
Adjacent sequences: A001315 A001316 A001317 * A001319 A001320 A001321
|
|
|
KEYWORD
| nonn,easy,nice,changed
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
EXTENSIONS
| More terms from David W. Wilson (davidwwilson(AT)comcast.net)
|
| |
|
|
