62640
domain: N
Appears in sequences
- Smallest integer k such that 2^n is the largest power of two that is contained in 2^k as a proper substring.at n=29A046300
- Numbers occurring twice in A068627.at n=36A068628
- Phi(A033631(n)) {phi is the Euler totient function A000010}.at n=26A115620
- Sums of the products of n consecutive triples of numbers.at n=9A135037
- Numbers with prime factorization pqr^3s^4.at n=19A190294
- Number of (n+2)X(6+2) 0..1 arrays with every 3X3 subblock sum of the two sums of the diagonal and antidiagonal minus the two minimums of the central column and central row nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=4A254905
- Number of (5+2)X(n+2) 0..1 arrays with every 3X3 subblock sum of the two sums of the diagonal and antidiagonal minus the two minimums of the central column and central row nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=5A254911
- a(n) is the exponent of the least power of 2 such that the concatenated digits of the decimal expansion of 2^n are a proper substring of the concatenated digits of the decimal expansion of 2^a(n).at n=29A342575
- Number of unrooted labeled binary trees satisfying a path-length criterion concerning three labeled leaves.at n=6A354690
- Number of permutations of [n] such that each cycle contains its length as an element.at n=9A362362
- Triangle read by rows: T(n,k) is the number of noncrossing path sets on n nodes with k paths and isolated vertices allowed, 0 <= k <= n.at n=58A390909