A362724 a(n) = [x^n] E(x)^n, where E(x) = exp( Sum_{k >= 1} A005258(k)*x^k/k ).

1, 3, 37, 525, 7925, 123878, 1980199, 32150030, 527984245, 8747075100, 145917510662, 2447835093498, 41253740275559, 697956867712705, 11847510103853090, 201678623730755525, 3441648250114203253, 58859380176953941937, 1008553120517397082420, 17311102730697482426850

Offset

0,2

Comments

Compare with A362722.

It is known that the sequence of Apéry numbers A005258 satisfies the Gauss congruences A005258(n*p^r) == A005258(n*p^(r-1)) (mod p^r) for all primes p and positive integers n and r.

One consequence is that the power series expansion of E(x) = exp( Sum_{k >= 1} A005258(k)*x^k/k ) = 1 + 3*x + 14*x^2 + 82*x^3 + 551*x^4 + ... has integer coefficients (see, for example, Beukers, Proposition, p. 143), and therefore a(n) = [x^n] E(x)^n is an integer.

In fact, the Apéry numbers satisfy stronger congruences than the Gauss congruences known as supercongruences: A005258(n*p^r) == A005258(n*p^(r-1)) (mod p^(3*r)) for all primes p >= 5 and positive integers n and r (see Straub, Section 1).

We conjecture below that {a(n)} satisfies supercongruences similar to (but weaker than) the above supercongruences satisfied by the Apéry numbers.

More generally, we inductively define a family of sequences {a(i,n) : n >= 0}, i >= 0, by setting a(0,n) = A005258(n) and, for i >= 1, a(i,n) = [x^n] ( exp(Sum_{k >= 1} a(i-1,k)*x^k/k) )^n. In this notation the present sequence is {a(1,n)}.

We conjecture that the sequences {a(i,n) : n >= 0}, i >= 1, satisfy the supercongruences u(n*p^r) == u(n*p^(r-1)) (mod p^(2*r)) for all primes p >= 3, and positive integers n and r.

Links

Table of n, a(n) for n=0..19.

F. Beukers, Some congruences for the Apery numbers, Journal of Number Theory, Vol. 21, Issue 2, Oct. 1985, pp. 141-155. local copy

Armin Straub, Multivariate Apéry numbers and supercongruences of rational functions, Algebra & Number Theory, Vol. 8, No. 8 (2014), pp. 1985-2008; arXiv preprint, arXiv:1401.0854 [math.NT], 2014.

Formula

Conjecture: the supercongruence a(n*p^r) == a(n*p^(r-1)) (mod p^(2*r)) holds for all primes p >= 3 and positive integers n and r.

Maple

A005258 := proc(n) add(binomial(n, k)^2*binomial(n+k, k), k = 0..n) end proc:
E(n, x) := series(exp(n*add(A005258(k)*x^k/k, k = 1..20)), x, 21):
seq(coeftayl(E(n, x), x = 0, n), n = 0..20);

Crossrefs

Cf. A005258, A362722 - A362733.

Sequence in context: A054596 A155667 A216696 * A333385 A331114 A245265

Adjacent sequences: A362721 A362722 A362723 * A362725 A362726 A362727

Keyword

nonn,easy

Author

Peter Bala, May 02 2023

Status

approved