24566

Appears in sequences

• A Fielder sequence.at n=16A001642
• a(n) = (2^n + C(2*n,n))/2.at n=9A005317
• Number of asymmetric (identity) trees with n nodes and 6 leaves.at n=10A055337
• Partial sums of A001157: Sum_{j=1..n} sigma_2(j).at n=38A064602
• Starting positions of strings of three 6's in the decimal expansion of Pi.at n=18A083625
• Number of 4 X n binary arrays without the pattern 0 1 diagonally, vertically, antidiagonally or horizontally.at n=28A188555
• a(n) = n*Fibonacci(n) - Sum_{i=0..n-1} Fibonacci(i).at n=17A190062
• Number of ways 1/n can be expressed as the sum of four distinct unit fractions: 1/n = 1/w + 1/x + 1/y + 1/z satisfying 0 < w < x < y < z.at n=40A241883
• Number of length n+6 0..3 arrays with every seven consecutive terms having the maximum of some three terms equal to the minimum of the remaining four terms.at n=1A250368
• T(n,k)=Number of length n+6 0..k arrays with every seven consecutive terms having the maximum of some three terms equal to the minimum of the remaining four terms.at n=7A250373
• Number of length 2+6 0..n arrays with every seven consecutive terms having the maximum of some three terms equal to the minimum of the remaining four terms.at n=2A250375
• a(n) = largest number of distinct words arising in Post's tag system {00, 1101} applied to a binary word w, over all starting words w of length n, or a(n) = -1 if there is a word w with an unbounded trajectory.at n=26A284116
• Numbers k such that the coefficient of x^k in the expansion of Product_{j>=1} (1 - x^j)^5 is zero.at n=29A302057
• A(n,k) = Sum_{j=0..floor(n/k)} (-1)^j*binomial(2*n,k*j+n), square array A(n,k) read by antidiagonals, for n >= 0, k >= 1.at n=64A307668