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!)
A024202 a(n) = [ (3rd elementary symmetric function of S(n))/(first elementary symmetric function of S(n)) ], where S(n) = {first n+2 odd positive integers}. 1

%I #14 Dec 31 2016 01:02:35

%S 1,11,38,96,205,385,662,1068,1635,2401,3410,4706,6339,8365,10840,

%T 13826,17391,21603,26536,32270,38885,46467,55108,64900,75941,88335,

%U 102186,117604,134705,153605,174426,197296,222343,249701,279510,311910,347047,385073

%N a(n) = [ (3rd elementary symmetric function of S(n))/(first elementary symmetric function of S(n)) ], where S(n) = {first n+2 odd positive integers}.

%H Robert Israel, <a href="/A024202/b024202.txt">Table of n, a(n) for n = 1..10000</a>

%F Empirical g.f.: x*(x^4-5*x^3-7*x-1) / ((x-1)^5*(x^2+x+1)). - _Colin Barker_, Aug 15 2014

%F From _Robert Israel_, Dec 30 2016: (Start)

%F a(n) = floor(A024197(n)/(n+2)^2) = floor(n*(n+1)*(n^2+3*n+1)/6).

%F a(n) = (n^4+4*n^3+4*n^2+n-4)/6 if n == 1 (mod 3).

%F Otherwise a(n) = n*(n+1)*(n^2+3*n+1)/6.

%F The empirical g.f. can be obtained from this. (End)

%p f:= proc(n)

%p if n mod 3 = 1 then (n^4+4*n^3+4*n^2+n-4)/6

%p else n*(n+1)*(n^2+3*n+1)/6

%p fi

%p end proc:

%p map(f, [$1..100]); # _Robert Israel_, Dec 30 2016

%t Table[Floor[n*(n + 1)*(n^2 + 3*n + 1)/6], {n, 1, 50}] (* _G. C. Greubel_, Dec 30 2016 *)

%o (PARI) for(n=1,25, print1(floor(n*(n+1)*(n^2+3*n+1)/6), ", ")) \\ _G. C. Greubel_, Dec 30 2016

%Y Cf. A024197.

%K nonn

%O 1,2

%A _Clark Kimberling_

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 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)