login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A339573 a(n) = floor(n*(n+1)/6) - 1. 2
0, 1, 2, 4, 6, 8, 11, 14, 17, 21, 25, 29, 34, 39, 44, 50, 56, 62, 69, 76, 83, 91, 99, 107, 116, 125, 134, 144, 154, 164, 175, 186, 197, 209, 221, 233, 246, 259, 272, 286, 300, 314, 329, 344, 359, 375, 391, 407, 424, 441, 458, 476, 494, 512, 531, 550, 569, 589, 609, 629, 650, 671, 692 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,3
COMMENTS
a(n) = A001840(n-1)-1.
LINKS
Bernhard Ganter, Notes on Integer Partitions, Technische Universität Dresden (2020); See Prop. 3.
FORMULA
G.f.: x^3*(-1-x^2+x^3) / ( (1+x+x^2)*(x-1)^3 ). - R. J. Mathar, Jan 14 2021
MATHEMATICA
Table[Floor[n (n + 1)/6] - 1, {n, 2, 80}] (* Robert P. P. McKone, Dec 19 2020 *)
PROG
(Python)
def A339573(n):
return n*(n+1)//6-1 # Chai Wah Wu, Dec 10 2020
CROSSREFS
Cf. A001840.
Sequence in context: A237886 A212555 A328787 * A060655 A117490 A359275
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Dec 10 2020
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 06:06 EDT 2024. Contains 371918 sequences. (Running on oeis4.)