[go: up one dir, main page]

login
Revision History for A333473 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
a(n) = [x^n] ( S(x/(1 + x)) )^n, where S(x) = (1 - x - sqrt(1 - 6*x + x^2))/(2*x) is the o.g.f. of the large Schröder numbers A006318.
(history; published version)
#15 by Andrey Zabolotskiy at Tue Jan 09 13:15:29 EST 2024
STATUS

editing

approved

#14 by Andrey Zabolotskiy at Tue Jan 09 13:15:26 EST 2024
NAME

a(n) = [x^n] ( S(x/(1 + x) ) )^n, where S(x) = (1 - x - sqrt(1 - 6*x + x^2))/(2*x) is the o.g.f. of the large Schröder numbers A006318.

STATUS

approved

editing

#13 by N. J. A. Sloane at Wed Oct 06 14:37:32 EDT 2021
STATUS

editing

approved

#12 by N. J. A. Sloane at Wed Oct 06 14:37:30 EDT 2021
COMMENTS

More generally, we conjecture that for a positive integer r and integer s, the sequence a(r,s;n) := [x^(r*n)] ( S(x/(1 + x)) )^(s*n) also satisfies the above supercongruencescongruences.

Note the sequence b(n) := [x^n] ( S(x) )^n = A103885(n) appears to satisfy the stronger congruences b(n*p^k) == b(n*p^(k-1)) ( mod p^(3*k) ) for prime p >= 5 and positive integers n and k. The sequence d(n) := [x^n] ( (1 + x)*S(x/(1 + x)) )^n = A333090(n) also appears to satisfy the same supercongruencescongruences.

STATUS

approved

editing

#11 by N. J. A. Sloane at Wed Oct 06 14:29:58 EDT 2021
COMMENTS

Note the sequence b(n) := [x^n] ( S(x) )^n = A103885(n) appears to satisfy the stronger supercongruences congruences b(n*p^k) == b(n*p^(k-1)) ( mod p^(3*k) ) for prime p >= 5 and positive integers n and k. The sequence d(n) := [x^n] ( (1 + x)*S(x/(1 + x)) )^n = A333090(n) also appears to satisfy the same supercongruences.

Discussion
Wed Oct 06
14:29
OEIS Server: https://oeis.org/edit/global/2915
#10 by N. J. A. Sloane at Wed Oct 06 14:24:32 EDT 2021
EXAMPLE

Examples of supercongruencescongruences:

Discussion
Wed Oct 06
14:24
OEIS Server: https://oeis.org/edit/global/2912
#9 by N. J. A. Sloane at Wed Oct 06 13:26:28 EDT 2021
COMMENTS

Here we take F(x) = S(x/(1 + x)) = 1 + 2*x + 4*x^2 + 12*x^3 + 40*x^4 + 154*x^5 + 544*x^6 + ...(see A025227), where S(x) is the o.g.f. of the large Schröder numbers A006318. We conjecture that the associated sequence a(n) = [x^n] ( S(x/(1 + x)) )^n satisfies the supercongruences congruences a(n*p^k) == a(n*p^(k-1)) ( mod p^(2*k) ) for prime p >= 5 and positive integers n and k. Cf. A333472.

Discussion
Wed Oct 06
13:26
OEIS Server: https://oeis.org/edit/global/2911
#8 by Peter Luschny at Sun Apr 05 13:49:57 EDT 2020
STATUS

editing

approved

#7 by Peter Luschny at Sun Apr 05 13:49:52 EDT 2020
EXAMPLE

a(11) - a(1) = 3040354176 - 2 = 2*(11^2)*13*966419 == 0 ( mod 11^2 ).

a(3*7) - a(3) = 12421053168197722112 - 92 = (2^2)*(3^7)*5*(7^2)* 5795401942927 == 0 ( mod 7^2 ).

a(5^2) - a(5) = 90551762251592215396352 - 6352 = (2^4)*(5^4)*293* 30905038311123623 == 0 ( mod 5^4 ).

STATUS

proposed

editing

#6 by Peter Bala at Fri Apr 03 04:03:45 EDT 2020
STATUS

editing

proposed