35146

Appears in sequences

• Define C(n) by the recursion C(0) = 3*i where i^2 = -1, C(n+1) = 1/(1 + C(n)), then a(n) = 3*(-1)^n/Im(C(n)) where Im(z) denotes the imaginary part of the complex number z.at n=10A069960
• Numbers k such that the decimal expansions of both k and k^2 have 1 as smallest digit and 6 as largest digit.at n=30A257197
• Expansion of Product_{k>=0} 1/(1-x^(4*k+1))^(4*k+1).at n=37A285048
• Number of necklace compositions of n such that every restriction to a circular subinterval has a different sum.at n=50A325681
• Expansion of (1/x) * Series_Reversion( x * (1+x)^2 / (1+x+x^3)^3 ).at n=11A372377