24494

Appears in sequences

• Consider recurrence b(0) = n/3, b(n) = b(0)*ceiling(b(n-1)); sequence gives first integer reached (or -1 if no integer is ever reached).at n=34A081852
• Let l(n) be the number of letters when n is written in French; sequence gives values of n where l(n) sets a new record.at n=40A105873
• Number of DUU's in all length n left factors of Dyck paths; here U=(1,1) and D=(1,-1).at n=16A191796
• Number of fixed polycairos with n cells.at n=7A196991
• Number of compositions of n in which the minimal multiplicity of parts equals 6.at n=18A244169
• Triangle of coefficients of Gaussian polynomials [2n+7,6]_q represented as finite sum of terms (1+q^2)^k*q^(g-k), where k = 0,1,...,g with g=6n+3.at n=62A267486
• Number of 3-regular cubic partitions of n.at n=34A335602
• Number of partitions of n such that 3*(greatest part) >= (number of parts).at n=37A347867
• E.g.f. satisfies log(A(x)) = 2 * (1 - exp(-x)) * A(x).at n=5A355782
• a(n) is the number of compositions of n into prime parts, with the 1st part equal to 2, the 2nd part less than or equal to 3, ..., and the k-th part less than or equal to prime(k), and so on.at n=32A359388