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!)
A024401 a(n) = [ (3rd elementary symmetric function of S(n))/(2nd elementary symmetric function of S(n)) ], where S(n) = {first n+2 positive integers congruent to 2 mod 3}. 0
1, 3, 6, 11, 16, 22, 30, 38, 47, 58, 69, 81, 95, 109, 124, 141, 158, 176, 196, 216, 237, 260, 283, 307, 333, 359, 386, 415, 444, 474, 506, 538, 571, 606, 641, 677, 715, 753, 792, 833, 874, 916, 960 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
Conjecture: a(n) = 2*a(n-1) - a(n-2) + a(n-3) - 2*a(n-4) + a(n-5). G.f. x*(-1-x-x^3-x^2+x^4) / ( (1+x+x^2)*(x-1)^3 ). - R. J. Mathar, Oct 08 2011
a(n) = floor(A024392(n) / A024391(n+1)). - Sean A. Irvine, Jul 07 2019
CROSSREFS
Sequence in context: A310114 A111582 A366471 * A333709 A266252 A267260
KEYWORD
nonn
AUTHOR
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 25 06:14 EDT 2024. Contains 371964 sequences. (Running on oeis4.)