1653750

Appears in sequences

• Primal codes of canonical finite permutations on positive integers.at n=28A109299
• Prime factorization representation of Stern polynomials: a(0) = 1, a(1) = 2, a(2n) = A003961(a(n)), a(2n+1) = a(n)*a(n+1).at n=39A260443
• T(n,k)=Number of nXk 0..2 arrays with every repeated value in every row unequal to the previous repeated value, and in every column equal to the previous repeated value, and new values introduced in row-major sequential order.at n=37A267911
• Number of 2 X n 0..2 arrays with every repeated value in every row unequal to the previous repeated value, and in every column equal to the previous repeated value, and new values introduced in row-major sequential order.at n=7A267913
• T(n,k)=Number of nXk 0..2 arrays with every repeated value in every row and column unequal to the previous repeated value, and new values introduced in row-major sequential order.at n=37A267957
• Even terms in A260442 (in A260443).at n=24A277200
• Odd bisection of A260443 (the even terms): a(n) = A260443((2*n)+1).at n=19A277324
• a(1) = 0; for n > 1, a(n) = Product_{d|n, d>1, d<n} prime(1+A297167(d)).at n=71A324193