40256

Appears in sequences

• a(n) = n! - n^2.at n=8A005008
• Poupard's triangle: triangle of numbers arising in enumeration of binary trees.at n=28A008301
• Poupard's triangle: triangle of numbers arising in enumeration of binary trees.at n=32A008301
• Numbers n such that 59*2^n-1 is prime.at n=12A050555
• Number of different values obtained by evaluating all different parenthesizations of 1/2/3/4/.../n.at n=20A078389
• a(n) is the smallest number greater than a(n-1) such that in a(0) through a(n) no digit occurs more than once more than any other digit.at n=37A095204
• a(n) = n! - n^(n-6).at n=2A144767
• Left half of Poupard's triangle, A008301.at n=18A210108
• a(n) = phi( a(n-1) + a(n-2) + 1) with a(0) = 0 and a(1) = 1.at n=27A228807
• Number of chess tableaux with n cells.at n=16A238014
• a(n) is the smallest number greater than a(n-1) such that in a(1) through a(n) no digit occurs more than once more than any other digit, starting with a(1) = 1.at n=37A248651
• Composites whose prime factorization in base 7 is an anagram of the number in base 7.at n=4A260051
• Expansion of phi(x^2) * chi(x)^4 in powers of x where phi(), chi() are Ramanujan theta functions.at n=27A260515
• Expansion of Product_{k>=0} 1/(1-x^(5*k+4))^(5*k+4).at n=46A285132
• Total sum of the number of divisors of the element sum over all nonempty subsets of [n].at n=12A309403
• Number of strict chains of divisors starting with n!.at n=7A337071