35790

Appears in sequences

• Smallest number with persistence n for the sort-and-subtract-sequence.at n=24A065641
• Number of different equations that can be made by summing numbers from 1 to n and using every number not more than once.at n=13A161943
• Irregular triangle T(n,k), n>=1, 1<=k<=ceiling(n/2), read by rows: T(n,k) is the number of different ways to select k disjoint (nonempty) subsets from {1..n} with equal element sum.at n=50A196231
• Triangle read by rows: coefficients in an asymptotic expansion of the n-th prime.at n=23A200265
• Number of triangles in a Star of David of size n.at n=15A299965
• Numbers k such that 327*2^k+1 is prime.at n=24A322956
• a(n) is the smallest number that can be partitioned into n ways as the sum of two brilliant numbers (A078972).at n=33A338474