62000

Appears in sequences

• List of pairs of consecutive refactorable numbers.at n=8A036898
• Number of sublattices of index n in generic 4-dimensional lattice.at n=27A038991
• Numbers k such that k and k+1 are both refactorable numbers.at n=4A114617
• Number of 2 X 2 symmetric matrices over Z(n) having nonzero determinant.at n=39A115077
• Numbers of isomers of unbranched a-4-catapolyheptagons - see Brunvoll reference for precise definition.at n=6A121141
• a(n) = n*(n+1)*(4*n+1)/2.at n=31A135713
• a(n)/n! is the probability of guessing "up/down" correctly through a deck of n cards marked 1, 2, ..., n, if one always makes the most probable guess.at n=9A144188
• a(n) = 4*(3*n+1)*(3*n+2).at n=41A144410
• Number of reduced words of length n in the Weyl group B_8.at n=15A161717
• a(n) = ((4+sqrt(5))*(5+sqrt(5))^n + (4-sqrt(5))*(5-sqrt(5))^n)/2.at n=5A163072
• Expansion of (H(-x) / chi(-x))^2 in powers of x where chi() is a Ramanujan theta function and G() is a Rogers-Ramanujan function.at n=31A261526
• Triangle read by rows: T(n,k) is the number of permutations p of {1..n} such that p(1)=k and p(i+1) < p(i) iff a strict majority of {1..n} \ {p(1)..p(i)} are < p(i).at n=45A318354
• Triangle read by rows: T(n,k) is the number of permutations p of {1..n} such that p(1)=k and p(i+1) < p(i) iff a strict majority of {1..n} \ {p(1)..p(i)} are < p(i).at n=54A318354
• Larger of amicable pair m < n defined by t(n) = m and t(m) = n where t(n) = psi(n) - n and psi(n) = A001615(n) is the Dedekind psi function.at n=23A323330