143143

Appears in sequences

• a(n) = binomial(n+5,5) * binomial(n+5,4)/(n+5).at n=9A006857
• Positive numbers k such that k and 2*k are anagrams in base 5 (written in base 5).at n=30A023061
• Lucky numbers that are concatenations of a number k with itself.at n=18A032650
• A084013(n)/n.at n=6A084014
• Divide n-th row of A084024 by n.at n=21A084025
• Tenth column (and diagonal) of Narayana triangle A001263.at n=4A134291
• Number of 4 X 9 matrices with elements in 0..n with each row and each column in nondecreasing order. 4,9,n can be permuted, see formula.at n=2A140919
• Triangle read by rows: T(n, k) = c(n, q)/(c(k, q)*c(n-k, q)), where c(n, q) = Product_{j=1..n} (j+q)!/(j-1)! and q = 8.at n=23A174109
• Triangle read by rows: T(n, k) = c(n, q)/(c(k, q)*c(n-k, q)), where c(n, q) = Product_{j=1..n} (j+q)!/(j-1)! and q = 8.at n=25A174109
• Total number of parts in all partitions of n plus the sum of largest parts in all partitions of n plus the number of partitions of n plus n.at n=31A225610
• Records in A240751.at n=40A285312
• Numbers q.r such that q*r divides q.r, when q and r have the same number of digits, "." means concatenation, and r may not begin with 0.at n=7A347541
• After a(1) = 1, the sequence is always extended with the smallest divisor d (not yet present in the sequence) of the last term t. If d doesn't exist, we extend the sequence with tt (t concatenated to itself). If tt doesn't produce a new d, we extend the sequence with ttt, etc. See the Comments section for more details.at n=42A348871
• Numbers k such that d(k) > d(k+1) > d(k+2) > d(k+3) > d(k+4), where d(n) is the number of divisors of n.at n=21A364720