30461

Appears in sequences

• Number of compositions (ordered partitions) of n into distinct parts.at n=29A032020
• a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 4.at n=14A049947
• Odd composite numbers which in base 2 contain their largest proper factor as a substring of digits.at n=36A063131
• Composite numbers not divisible by 2, 3, 5 or 7 which in base 2 contain their largest proper factor as a substring.at n=30A063138
• Numbers n which equal the sum of the prime factors of n^2+1217*n+370313.at n=10A159004
• a(n) = (n^3 - 2*n^2 + 3*n + 2)/2.at n=40A189890
• a(n) = Sum_{k=0..2*n/3} C(n-k,2*k-n)^2.at n=23A298567
• Number of multisets of exactly six partitions of positive integers into distinct parts with total sum of parts equal to n.at n=20A320791
• Number of compositions (ordered partitions) of n into distinct parts having a common factor > 1 with n.at n=58A332003
• Number of ways to split a strict composition of n into contiguous subsequences all having the same sum.at n=29A336130
• Number of compositions of n into distinct parts, any two of which have a common divisor > 1.at n=58A337983