35443

Appears in sequences

• a(n) = Sum_{k=0..5} binomial(n,k).at n=22A006261
• Strong pseudoprimes to base 28.at n=16A020254
• Strong pseudoprimes to base 42.at n=19A020268
• Strong pseudoprimes to base 63.at n=24A020289
• Structured octagonal prism numbers.at n=22A100176
• a(n) = smallest k such that A(k) == 0 (mod 2^n), where A(0) = 1 and A(k) = k*A(k-1) + 1 = A000522(k).at n=15A127014
• a(n) = smallest k such that A(k) == 0 (mod 2^n), where A(0) = 1 and A(k) = k*A(k-1) + 1 = A000522(k).at n=16A127014
• Number of ways of placing kings with no more than 2 mutual attacks on an n X n chessboard symmetric under horizontal and vertical reflection.at n=12A143877
• Numbers with 3 or more prime factors (with multiplicity) such that every concatenation of their prime factors is prime.at n=38A217264
• Numbers n such that n^2 + 1 is divisible by a 5th power.at n=22A218564
• Numbers of vectors with 2*n integers such that each element is either 1 or -1, and their sum > n.at n=10A226197
• Positive integers m such that pi(m^3) = pi(j^3) + pi(k^3) for some 0 < j <= k < m.at n=29A262409
• Irregular triangle T(n,m), numerators of coefficients in a power/Fourier series expansion of the plane pendulum's exact time dependence.at n=27A274130
• Numbers k such that 3^(k-1) == 2^(k-1) !== 1 (mod k).at n=32A285300
• Numbers m > 1 such that every prime divisor p of m satisfies s_p(m) = p.at n=21A324458
• G.f. A(x) satisfies: A(x) = 1 + x * A(x/(1 - x)) / (1 - x^2).at n=10A346771
• a(n) = Sum_{k=0..n} binomial(4*n+2,k).at n=5A387009