OFFSET
1,1
COMMENTS
These are the values from Table 1 on p. 14 of Sun and Moll.
REFERENCES
D. Bressoud, Proofs and Confirmations: the story of the Alternating Sign Matrix Conjecture, Cambridge University Press, 1999.
LINKS
D. Bressoud and J. Propp, How the Alternating Sign Matrix Conjecture was solved, Notices Amer. Math. Soc., 46:637-646, 1999.
Xinyu Sun and Victor H. Moll, The p-adic valuations of sequences counting alternating sign matrices, arXiv:0901.4564 [math.NT], 2009.
Andrei Zabolotskii, Rust program.
FORMULA
a(n) = #{k: A194827(k) = n}.
EXAMPLE
a(7) = 8 because "the eight solutions to Nu(T(n)) = 7 are 26, 38, 46, 82, 5462, 10922, 10924 and J_15 - 1 = 21844" where J_k = k-th Jacobsthal number = A001045(k+1).
PROG
(SageMath)
def s(n): return int(n).bit_count()
def upto(n):
a, x = [0] * n, 0
for i in (1..lucas_number1(2*n+2, 1, -2)):
x += s(2*i-2) + s(2*i-1) - s(i-1) - s(3*i-2)
if x and x <= n: a[x-1] += 1
return a # Andrei Zabolotskii, Oct 27 2025
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Jonathan Vos Post, Jan 30 2009
EXTENSIONS
Edited and extended with a(9)-a(22) by Andrei Zabolotskii, Oct 29 2025
STATUS
approved
