72912
domain: N
Appears in sequences
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 45.at n=5A031723
- G.f.: 4th root of weight enumerator of [64,22,16] Reed-Muller code RM(2,6).at n=6A110836
- G.f.: 16th root of weight enumerator of [64,57,4] Reed-Muller code RM(4,6).at n=3A110850
- Number of unlock patterns of length n for the Android operating system.at n=7A163889
- a(n) = 7*A000330(n).at n=31A169607
- Triangle read by rows: T(n,k) is the number of peakless Motzkin paths of length n having k UHD's; here U=(1,1), H=(1,0), and D=(1,-1).at n=58A190172
- Expansion of Product_{k>=1} 1/(1 - k*(x^(2*k+1))).at n=46A266138
- Numbers k such that k = rad(k) * sopfr(k), where rad(k) is the squarefree kernel of k and sopfr(k) the integer log of k.at n=29A280935
- Expansion of Product_{k>=1} 1/(1 - x^(2*k-1))^(k*(3*k-1)/2).at n=20A294669
- Triangle read by rows. The numerators of the coefficients of the Faulhaber polynomials. T(n,k) for n >= 0 and 0 <= k <= n.at n=50A335951
- Array read by downward antidiagonals: A(n,k) = A(n,k-1) + (k+1)*(A(n-1,k) + A(n-1,k+1)) with A(n,0) = A(n-1,0) + A(n-1,1), A(0,k) = 1, n >= 0, k >= 0.at n=26A379460
- Consecutive states of the linear congruential pseudo-random number generator (1021*s + 25673) mod 121500 when started at s=1.at n=7A385341