18927

Appears in sequences

• Numbers in A070938 that set a new record for digital sums and ending digits.at n=16A070594
• a(n) is the smallest multiple of n such that a(n) mod 100 = n and S(n)=n where S(n) is the sum of the base-ten digits of n, or 0 if no such a(n) exists.at n=26A075154
• L-th order palindromes with L > 2.at n=9A089381
• Number of binary words of length n containing at least one subword 10^{10}1 and no subwords 10^{i}1 with i<10.at n=59A143290
• Numbers n such that prime[(n + 1)^2] - prime[n^2] is a perfect square.at n=26A145290
• a(n) = n^3 - n^2 - n.at n=27A152015
• a(n) = nonnegative value y such that (A155135(n), y) is a solution to the Diophantine equation x^3+28*x^2 = y^2.at n=28A155137
• a(n) = nonnegative value y such that (A155136(n), y) is a solution to the Diophantine equation x^3+28*x^2 = y^2.at n=27A155138
• a(n) = 676*n - 1.at n=27A158393
• a(n) = 28*n^2 - 1.at n=25A158554
• Triangle t(n,k) read by rows: fibonomial ratios c(n)/(c(k)*c(n-k)) where c are partial products of a generalized Fibonacci sequence with multiplier m=5.at n=17A172342
• Triangle t(n,k) read by rows: fibonomial ratios c(n)/(c(k)*c(n-k)) where c are partial products of a generalized Fibonacci sequence with multiplier m=5.at n=18A172342
• a(1)=15; for n>1, a(n) = the smallest number k >a(n-1) such that 2*A174214(k)= 3*(k-1).at n=10A174216
• a(n) is the smallest multiple of n such that a(n) ends with n and S(a(n))=n where S(m) is the sum of the base ten digits of m, or 0 if no such a(n) exists.at n=26A187924
• Minimal order of degree-n irreducible polynomials over GF(19).at n=20A218362
• Number of parts of even multiplicities in all the partitions of n.at n=35A264400