49392

Appears in sequences

• Digital sum of n = sum of palindromes from the smallest prime factor of n to the largest prime factor of n.at n=18A074310
• Non-perfect powers k for which q = A051903(k)/A051904(k) is an integer, A051904(k) > 1.at n=8A093770
• a(n) = binomial(n+3,2)*binomial(n+4,3)*binomial(n+5,5)/12.at n=5A107916
• Numbers of the form (7^i)*(12^j), with i, j >= 0.at n=17A108238
• Powerful numbers (definition 1) sandwiched between twin primes.at n=12A113839
• Central terms of triangle A116071, which equals Pascal's triangle to the matrix power of Pascal's triangle.at n=5A116072
• Sequence terms are generated by solving the n x n linear algebra problem [H]x = b, where b is the unit vector. Only xn, the last unknown is used.at n=9A124261
• Averages of twin prime pairs k such that k*7 and k/7 are squares.at n=3A154673
• Triangle T(n, k) = 0 if BernoulliB(n-k) = 0 otherwise round( binomial(n, k)/BernoulliB(n-k)^k ), read by rows.at n=38A156811
• Totally multiplicative sequence with a(p) = 7*(p+2) for prime p.at n=27A167308
• Worpitzky(n, k)*Harmonic(k), triangle read by rows.at n=34A176276
• Floor(1/{(6+n^4)^(1/4)}), where {}=fractional part.at n=41A184630
• Numbers with prime factorization p^2*q^3*r^4 where p, q, and r are distinct primes.at n=7A190115
• Strong Achilles numbers: Achilles numbers m such that phi(m) is also an Achilles number, where phi(m) denotes Euler's totient function of m.at n=20A194085
• Achilles number whose largest proper divisor is also an Achilles number.at n=28A203662
• Numbers k such that the sum of prime factors of k (counted with multiplicity) equals five times the largest prime divisor of k.at n=23A212863
• Number of (w,x,y) with all terms in {0,...,n} and 2*w >= |x+y-z|.at n=41A213397
• Sum of the partition parts of 3n into 3 parts.at n=27A235988
• Number T(n,k) of ascent sequences of length n with exactly k flat steps; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=57A242153
• Number of ascent sequences of length n with exactly two flat steps.at n=7A242155