19995

Appears in sequences

• Smallest multiple of 5 with digit sum n.at n=32A069534
• Numbers k such that there are no prime numbers between reverse(k) and 3*k.at n=9A074815
• Array T(q,n) by antidiagonals: number of self-reciprocal polynomials of degree 2*n over GF(q) (for q >= 2 and n >= 1).at n=61A098691
• Numbers k such that the k-th triangular number contains only digits {0,1,9}.at n=14A119048
• Coefficients of x+(x+1)^2+(x+2)^3+(x+3)^4+(x+4)^5+(x+5)^6+(x+6)^7+(x+7)^8, highest power first.at n=3A179466
• Number of (n+2) X 3 binary arrays with each 3 X 3 subblock having rows and columns in lexicographically nondecreasing order.at n=38A184540
• G.f.: 1/(1 - x/(1 - x^3/(1 - x^4/(1 - x^7/(1 - x^11/(1 - x^18/(1 -...- x^Lucas(n)/(1 -...)))))))), a continued fraction.at n=26A206742
• Number of n-bead necklaces of n colors allowing reversal, with no adjacent beads having the same color.at n=6A208538
• Number of n-bead necklaces of 7 colors allowing reversal, with no adjacent beads having the same color.at n=6A208543
• Number of 7-bead necklaces of n colors allowing reversal, with no adjacent beads having the same color.at n=6A208545
• Number of 2 X 2 matrices having all terms in {1,...,n} and determinant = 1 (mod 3).at n=15A211071
• Numbers k such that 3^k - 10 is prime.at n=27A217347
• Let p = first digit of n, q = number obtained if p is removed from n; let r = last digit of n, s = number obtained if r is removed from n; sequence give n such that p*q = r*s != 0, p! = q, and r! = s.at n=31A245364
• Numbers N such that N = P//Q = R//S, where // is the concatenation function, satisfying the following properties: P and S are m-digit integers, Q and R are k-digit integers, k and m are distinct positive integers, and P*Q = R*S.at n=31A245385
• Numbers in A245385 where P, Q, R, and S are all distinct.at n=12A245386
• Seventh partial sums of fifth powers (A000584).at n=4A254871
• Numbers divisible by prime(d) for each digit d in their base-6 representation, none of which may be zero.at n=32A256876
• a(n) = 301*binomial(n-1,8)+52*binomial(n-1,7)+binomial(n-1,6).at n=6A274503
• Number of multisets of nonempty words with a total of n letters over ternary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.at n=11A293733
• Numbers n with the property that k*n and (k+1)*n have a common nonzero digit for all k.at n=29A308466