cp's OEIS Frontend

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.

Showing 1-2 of 2 results.

A240980 Numerators of f(n) with 2*f(n+1) = f(n) + A198631(n)/A006519(n+1), f(0)=0.

Original entry on oeis.org

0, 1, 1, 1, 0, 0, 1, 1, -1, -1, 15, 15, -169, -169, 10753, 10753, -28713, -28713, 1586789, 1586789, -27542974, -13771487, 4694573547, 4694573547, -60230569205, -60230569205, 7328718272473, 7328718272473, -1043166080490099, -1043166080490099, 343459524172314625, 343459524172314625
Offset: 0

Views

Author

Paul Curtz, Aug 06 2014

Keywords

Comments

An autosequence is a sequence which has its inverse binomial transform equal to the signed sequence. (Examples: 1) A000045(n) is of the first kind. 2) 1/(n+1) is of the second kind).
f(n), companion to A198631(n)/A006519(n+1), is an autosequence of the first kind.
The difference table of f(n) is:
0, 1/2, 1/2, 1/4, 0, 0, ...
1/2, 0, -1/4, -1/4, 0, 1/4, ...
-1/2, -1/4, 0, 1/4, 1/4, -3/8, ...
1/4, 1/4, 1/4, 0, -5/8, -5/8, ...
etc.
The main diagonal is 0's=A000004. The first two upper diagonal are equal.
a(n) are the numerators of f(n).
f(n) is the first sequence of the family of alternated autosequences of the first and of the second kind
0, 1/2, 1/2, 1/4, 0, 0, ...
1, 1/2, 0, -1/4, 0, 1/2, ... = A198631(n)/A006519(n+1),
0, -1/2, -1/2, 1/4, 1, -1/2, ...
-1, -1/2, 1, 7/4, -2, -8, ...
etc.
Like A164555(n)/A027642(n), A198631(n)/A006519(n+1) is an autosequence which has its main diagonal equal to the first upper diagonal multiplied by 2. See A190339(n).
The first column is 0 followed by A122045(n).
For the numerators of the second column see A241209(n).

Examples

			2*f(1) = 0 + 1, f(1) = 1/2;
2*f(2) = 1/2 + 1/2, f(2) = 1/2;
2*f(3) = 1/2 + 0, f(3) = 1/4.
		

Crossrefs

Programs

  • Mathematica
    Clear[f]; f[0] = 0; f[1] = 1/2; f[n_] := f[n] = (1/2)*(EulerE[n-1, 1]/2^IntegerExponent[n-1, 2] + f[n-1]); Table[f[n] // Numerator, {n, 0, 31}] (* Jean-François Alcover, Aug 06 2014 *)

A238235 Numerators of Euler twin numbers Et(n).

Original entry on oeis.org

1, -1, -1, -1, 1, 1, -1, -17, 17, 31, -31, -691, 691, 5461, -5461, -929569, 929569, 3202291, -3202291, -221930581, 221930581, 4722116521, -4722116521, -968383680827, 968383680827, 14717667114151, -14717667114151
Offset: 0

Views

Author

Paul Curtz, Feb 20 2014

Keywords

Comments

Et(n) = 1, -1/2, -1/2, -1/4, 1/4, 1/2, -1/2, -17/8, 17/8, 31/2, -31/2, -691/4, 691/4, 5461/2, -5461/2,... =a(n)/b(n) is mentioned in A233808.
Denominators: b(n)= 1, 2, 2, 4, 4, 2, 2, 8, 8,... = A065176(n) with 1 instead of 0.
Et(n) is the first difference of 0, followed by A198631(n)/A006519(n+1).
Et(n+2) = -1/2, -1/4, 1/4, 1/2,... is an autosequence of the second kind. Its main diagonal is the double of the following diagonal, the inverse binomial transform of Et(n+2) being Et(n+2) signed.
The denominators of the difference table of Et(n+2) are even numbers of the form 2^p. For the Bernoulli twin numbers A051716(n+1)/A051717(n+2), the denominators of the difference table, A168426(n), are multiples of 3.

Crossrefs

Cf. A051716/A051717 (Bernoulli twin numbers).

Programs

  • Mathematica
    Join[{1, -1, -1}, Table[{nu = Numerator[EulerE[2*n+1, 1]], -nu}, {n, 1, 12}]] // Flatten (* Jean-François Alcover, Feb 24 2014 *)

Formula

Binomial transform of A141424(n)/(A053644(n) with 1 instead of 0).
a(2n+3) = (-1)^n*A002425(n+2) = -a(2n+4).
Showing 1-2 of 2 results.