40768

Appears in sequences

• a(n) = n + (n+1)^2 + (n+2)^3 + (n+3)^4.at n=11A027621
• Third binomial transform of A010685 (period 2: repeat 1,4).at n=7A080960
• Sigma unitary-sigma perfect numbers: numbers m which satisfy the following equation for some integer k: sigma(usigma(m)) = k*m where usigma(m) is sum of unitary divisors of m.at n=27A083288
• Heptagonal numbers divisible by 7.at n=37A117795
• Heptagonal numbers A000566 which are the sum of two other heptagonal numbers > 0.at n=15A133251
• Product of the nonzero exponents in the prime factorization of n!.at n=30A135291
• Product of the nonzero exponents in the prime factorization of n!.at n=31A135291
• Numbers with 42 divisors.at n=37A175750
• Number of arrangements of 3 nonzero numbers x(i) in -n..n with the sum of trunc(x(i)/x(i+1)) equal to zero.at n=29A189546
• Number of ways to place 3 points on an n X n square grid so that no more than 2 points are on a vertical or horizontal straight line.at n=7A279437
• Triangle read by rows: T(n, k) = binomial(2*n, n + k) * binomial(n + 1, k)/(n + 1).at n=39A286784
• Number of nX3 0..1 arrays with each 1 adjacent to 1, 3 or 4 king-move neighboring 1s.at n=7A296799
• T(n,k)=Number of nXk 0..1 arrays with each 1 adjacent to 1, 3 or 4 king-move neighboring 1s.at n=47A296804
• T(n,k)=Number of nXk 0..1 arrays with each 1 adjacent to 1, 3 or 4 king-move neighboring 1s.at n=52A296804
• Least number k such that n divides gcd(sigma(k), phi(k), tau(k)).at n=20A307640
• Numbers all of whose divisors are odious numbers (A000069) with a record number of divisors.at n=18A330289
• Number of ways to write n as an ordered sum of 8 primes.at n=25A340964
• Positions of records in A116489.at n=26A342868
• Expansion of e.g.f. exp( x * (exp(2 * x) - 1) ).at n=7A351736
• Numbers m such that A357761(m) > A357761(k) for all k < m.at n=18A357763