cp's OEIS Frontend

A233808 Autosequence preceding A198631(n)/A006519(n+1). Numerators.

%I A233808 #16 Feb 06 2023 14:22:26
%S A233808 0,0,1,3,3,5,5,7,7,-3,-3,121,121,-1261,-1261,20583,20583,-888403,
%T A233808 -888403,24729925,24729925,-862992399,-862992399,36913939769,
%U A233808 36913939769,-1899853421885,-1899853421885
%N A233808 Autosequence preceding A198631(n)/A006519(n+1). Numerators.
%C A233808 The fractions are g(n)=0, 0, 1, 3/2, 3/2, 5/4, 5/4, 7/4, 7/4, -3/8, -3/8, 121/8, 121/8, -1261/8, -1261/8, 20583/8, 20583/8, -888403/16, -888403/16,... . The denominators are 1, 1, followed by A053644(n+1).
%C A233808 g(n+2) - g(n+1) = A198631(n)/A006519(n+1).
%C A233808 The corresponding fractions to g(n) are f(n) in A165142(n).
%C A233808 g(n) differences table:
%C A233808 0,       0,    1,  3/2,  3/2,  5/4,
%C A233808 0,       1,  1/2,    0, -1/4,    0,
%C A233808 1,    -1/2, -1/2, -1/4,  1/4,  1/2,    Euler twin numbers (new),
%C A233808 -3/2,    0,  1/4,  1/2,  1/4,   -1,
%C A233808 3/2,   1/4,  1/4, -1/4, -5/4, -5/8,
%C A233808 -5/4,    0, -1/2,   -1,  5/8, 13/2, etc.
%C A233808 Like A198631(n)/A006519(n+1),g(n) is an autosequence of the second kind.
%C A233808 If we proceed, here for Euler polynomials, like in A233565 for Bernoulli polynomials, we obtain
%C A233808 1) A133138(n)/A007395(n) (unreduced form) or
%C A233808 2) A233508(n)/A232628(n) (reduced form),the first array in A133135.
%C A233808 The Bernoulli's corresponding fractions to 1) are A193815(n)/(A003056(n) with 1 instead of 0).
%F A233808 a(n) = 0, 0, followed by (-1)^n *A141424(n).
%t A233808 max = 27; p[0] = 1; p[n_] := (1 + x)*((1 + x)^(n - 1) + x^(n - 1))/2; t = Table[Coefficient[p[n], x, k], {n, 0, max + 2}, {k, 0, max + 2}]; a[n_] := (-1)^n*Inverse[t][[n, 2]] // Numerator; a[0] = 0; Table[a[n], {n, 0, max}] (* _Jean-François Alcover_, Jan 11 2016 *)
%Y A233808 Cf. A051716/A051717, Bernoulli twin numbers.
%K A233808 sign,frac
%O A233808 0,4
%A A233808 _Paul Curtz_, Dec 16 2013