29768

Appears in sequences

• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (odd natural numbers), t = (primes).at n=35A024603
• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (odd natural numbers), t = (primes).at n=34A025117
• Least number k such that k has n anti-divisors.at n=38A066464
• Numbers n such that sopf(n) = sopf(n-1) - sopf(n-2), where sopf(x) = sum of the distinct prime factors of x.at n=9A076527
• G.f. A(x) satisfies: A(x) = 1/(1-2*x) + x^2*A(x)^2.at n=11A086622
• Maximal length of rook tour on an n X n+1 board.at n=34A152132
• Maximal length of rook tour on an n X n+3 board.at n=33A152134
• Number of 4-step S, NW and NE-moving king's tours on an n X n board summed over all starting positions.at n=34A187378
• Number of segments needed to draw (on the infinite square grid) a diagram of regions and partitions of n.at n=34A211026
• Numbers of the form p^2*q^3 where p, q are (not necessarily distinct) primes.at n=44A216417
• Let x(0)x(1)... x(q-1)x(q) denote the decimal expansion of a number n. The sequence lists the numbers such that n and the number represented by its middle digits x(1)x(2)...x(q-1) have the same distinct prime divisors.at n=22A243812
• Achilles numbers which are coprime to the sum of their divisors.at n=38A248022
• Number of (n+2)X(5+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00001001 or 00100101.at n=7A260977
• Either 8th power of a prime, or product of a square and a cube of two different primes.at n=42A272191
• Numbers whose sum of squarefree divisors and sum of nonsquarefree divisors are both squarefree numbers.at n=12A300984
• Fourier coefficients of the modular form (1/t_{6a}) * (1-12*sqrt(-3)/t_{6a})^(11/6) * F_{6a}^14.at n=3A341569
• Cogrowth sequence of the 18-element group S3 X C3 = <S,T,U | S^3, T^2, U^3, (ST)^2, [S,U], [T,U]>.at n=12A378109
• Achilles numbers that are deficient.at n=39A379164