85932
domain: N
Appears in sequences
- a(n) = denominator of Bernoulli(2n)/(2n).at n=14A006953
- Denominators from e.g.f. 1/(1-exp(-x)) - 1/x.at n=29A075180
- For odd n, a(n) = 2; for even n, a(n) = denominator of Bernoulli(n)/n; The number 2 alternating with the elements of A006953.at n=29A185633
- Number of n X 4 0..1 arrays with rows and columns lexicographically nondecreasing read forwards, and nonincreasing read backwards.at n=30A201371
- Number of n X 3 0..2 arrays with every 1 immediately preceded by 0 to the left or above, and every 2 immediately preceded by both a 1 and a 0.at n=5A203366
- Number of nX6 0..2 arrays with every 1 immediately preceded by 0 to the left or above, and every 2 immediately preceded by both a 1 and a 0.at n=2A203369
- T(n,k)=Number of nXk 0..2 arrays with every 1 immediately preceded by 0 to the left or above, and every 2 immediately preceded by both a 1 and a 0.at n=30A203371
- T(n,k)=Number of nXk 0..2 arrays with every 1 immediately preceded by 0 to the left or above, and every 2 immediately preceded by both a 1 and a 0.at n=33A203371
- Least positive integer k such that 5^n-1 and k^n-1 are relatively prime.at n=29A270360
- a(n) is the period of the oscillating pattern formed by a 1 X n line of cells in the Life-like cellular automaton B2c3-cekq4ikt5i8/S2-in3-acky4aijry5eiky6i, or 0 if the pattern vanishes.at n=48A298819
- T(n, k) = [x^k] (1/2 - x)^(-n) - (1 - x)^(-n).at n=31A356117
- G.f. A(x) satisfies A(x) = 1 + x^4*(1+x)^2*A(x)^3.at n=25A366592