231000

Appears in sequences

• Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n and having k UU's (doublerises) (n >= 1; 0 <= k <= n-1).at n=61A128718
• Numbers m that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (m raised to k+1 must not be a multiple). Case k=16.at n=9A135201
• Least positive integer with even digit sum in bases 2..n.at n=32A135738
• Least positive integer with even digit sum in bases 2..n.at n=33A135738
• Least positive integer with even digit sum in bases 2..n.at n=34A135738
• Least positive integer with even digit sum in bases 2..n.at n=35A135738
• Third right hand column of triangle A163934.at n=7A163935
• Numbers with prime factorization pqrs^3t^3.at n=10A190385
• Łukasiewicz words (without the last zero) for rooted plane trees where non-leaf branching can occur only at the leftmost branch of any level, but nowhere else.at n=40A209644
• Central terms of the triangle in A074911.at n=7A225621
• Triangular array read by rows. T(n,k) is the number of functions f:{1,2,...,n}->{1,2,...,n} whose functional digraph has exactly k nodes such that no nonrecurrent element is mapped into it. n >= 1, 1 <= k <= n.at n=23A231536
• Triangle read by rows: T(n,k) is the number of bargraphs of semiperimeter n having k L-shaped corners (n>=2, k>=0).at n=60A273717
• a(n) = Product_{d|n, d>1} prime(A304101(d)-1).at n=47A304104
• Number of permutations of [n] in which the length of every increasing run is 0 or 1 (mod 4).at n=11A317111
• Self-stuffable numbers (see the Comments section for definition).at n=10A322323
• Numbers whose infinitary divisors have a mean infinitary abundancy index that is larger than 2.at n=26A374788