This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A024399 #12 Jul 07 2019 02:25:27 %S A024399 5,31,101,248,515,952,1619,2586,3930,5738,8107,11141,14954,19670, %T A024399 25420,32345,40596,50331,61718,74935,90167,107609,127466,149950, %U A024399 175283,203697,235431,270734,309865,353090,400685,452936,510136,572588,640605,714507 %N A024399 a(n) = [ (3rd elementary symmetric function of S(n))/(first elementary symmetric function of S(n)) ], where S(n) = {first n+2 positive integers congruent to 2 mod 3}. %F A024399 Conjecture: a(n)= +4*a(n-1) -6*a(n-2) +5*a(n-3) -5*a(n-4) +6*a(n-5) -4*a(n-6) +a(n-7). G.f. x*(-5-11*x-7*x^2-5*x^3+x^4) / ( (1+x+x^2)*(x-1)^5 ). - _R. J. Mathar_, Oct 08 2011 %F A024399 a(n) = floor(A024392(n) / A005449(n + 2)). - _Sean A. Irvine_, Jul 06 2019 %Y A024399 Cf. A024392, A005449. %K A024399 nonn %O A024399 1,1 %A A024399 _Clark Kimberling_