editing
approved
editing
approved
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.
approved
editing
editing
approved
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.
approved
editing
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.
Examples of supercongruencescongruences:
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.
editing
approved
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 ).
proposed
editing
editing
proposed