25011

Appears in sequences

• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 17 ones.at n=28A031785
• Numbers k such that sopfr(k) = sopfr(k - sopfr(k)).at n=26A050781
• A certain class of stable matchings.at n=14A069156
• Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k ascents of length 2 starting at an even level (0<=k<=floor(n/2)).at n=37A114462
• Numbers that end with decimal digit 1, 3, 7, or 9 and that produce only composite numbers when any of the digits 0,1,...,9 is inserted anywhere in them (including at the beginning or end).at n=0A125268
• Numbers a = b + c where a, b, and c contain the same decimal digits.at n=32A203024
• Least positive integer m with prime(m)+2 and prime(prime(m))+2 both prime such that prime(m*n)+2 and prime(prime(m*n))+2 are both prime.at n=3A259487
• Number of pairs (lambda,mu) of partitions lambda of n and mu of three with mu <= lambda (by diagram containment).at n=29A303853
• Number of non-weakly alternating integer compositions of n.at n=16A349053
• Lower bounds for the maximum number of stable matchings in the stable marriage problem based on composing smaller instances.at n=14A357271
• 31-gonal numbers: a(n) = n*(29*n-27)/2.at n=42A360488
• Number of integer partitions of n whose length is not a semi-sum of the parts.at n=41A367398