62464

Appears in sequences

• a(n) = (2*n - 3)n^2.at n=32A015238
• Product of terms of continued fraction expansion of (3/2)^n.at n=17A071337
• Number of subsets of integers 1 through n (including the empty set) containing no pair of integers that share a common factor.at n=31A084422
• a(0)=1, a(2n) = 2a(2n-1)+a(n), a(2n+1) = 2a(2n)+2a(n).at n=13A084566
• 2^(n-1)*(n^2+2n+2).at n=10A084850
• Numbers with 22 divisors.at n=16A137485
• a(n) = 61*n^2.at n=32A174333
• 1/4 the number of (n+1) X 4 0..2 arrays with every 2 X 2 subblock having distinct edge sums.at n=10A209377
• Number of (n+1) X (2+1) 0..1 arrays with no 2 X 2 subblock having the maximum of its diagonal elements greater than the absolute difference of its antidiagonal elements.at n=7A251311
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with no 2X2 subblock having the maximum of its diagonal elements greater than the absolute difference of its antidiagonal elements.at n=37A251317
• Decimal representation of the n-th iteration of the "Rule 61" elementary cellular automaton starting with a single ON (black) cell.at n=10A266788
• Bi-unitary barely abundant numbers: bi-unitary abundant numbers k such that bsigma(k)/k < bsigma(m)/m for all bi-unitary abundant numbers m < k, where bsigma(k) is the sum of the bi-unitary divisors of k (A188999).at n=22A302571
• Bi-unitary near-perfect numbers: bi-unitary abundant numbers k such that the abundance d = bsigma(k) - 2*k is a bi-unitary divisor of k, where bsigma(k) is the sum of bi-unitary divisors of k (A188999).at n=42A303359
• Number of subsets S of vectors in GF(2)^n such that span(S) = GF(2)^n.at n=4A305737
• Numbers k such that bsigma(k) = 2k + 2, where bsigma(k) is the sum of bi-unitary divisors of k (A188999).at n=5A322162
• Numbers m such that abs(K(m+1) - K(m)) = 1, where K(m) = A002034(m) is the Kempner function.at n=34A346211
• Square array read by upward antidiagonals: T(n, k) = numerator( 2*k!*(-2)^k*Sum_{m=1..n}( 1/(2*m-1)^(k+1) ) ).at n=25A370692