24579

Appears in sequences

• Number of partitions satisfying cn(2,5) + cn(3,5) <= cn(1,5) + cn(4,5).at n=39A039895
• New record highs reached in A060000.at n=16A060013
• a(0) = 0, a(1) = a(2) = 1, a(3) = 2, a(4) = 4, a(5) = 8, a(6) = 16, for n>5: a(n+1) = SORT[ a(n) + a(n-1) + a(n-2) + a(n-3) + a(n-4) + a(n-5) + a(n-6)], where SORT places digits in ascending order and deletes 0's.at n=41A108567
• Numbers k such that 13*k = A048720(29,k), where A048720 is carryless base-2 multiplication.at n=44A115805
• a(n) is the number whose binary representation is A138144(n).at n=14A147595
• G.f.: exp( Sum_{n>=1} A082758(n)*x^n/n ), where A082758(n) = sum of the squares of the trinomial coefficients in row n of triangle A027907.at n=6A168592
• Numbers whose binary representation is palindromic and in which all runs of 0's and 1's have length at least 2.at n=53A222813
• Triangle of order m: C(n,k) = k*(n-k+1)^(k+m)+n-k, 0 <= k <= n, m = 0, read by rows.at n=51A278910
• a(n) = a(n-1) + a(n-2) + 2*a(floor(n/2)) + 3*a(floor(n/3)) + ... + n*a(floor(n/n)), where a(0) = 1, a(1) = 1, a(2) = 1.at n=16A298369
• Number of Motzkin meanders of length n with an odd number of humps.at n=11A307572
• a(0)=4; if n > 0 is even then a(n) = 2^(n/2+1)+3, otherwise a(n) = 3*(2^((n-1)/2)+1).at n=27A343177