269225

Appears in sequences

• Restricted combinations.at n=25A006500
• Number of nonempty subsets of {1,2,...,n} in which exactly 3/4 of the elements are <= (n-1)/3.at n=35A048009
• Number of nonempty subsets of {1,2,...,n} in which exactly 3/4 of the elements are <= (n-2)/3.at n=35A048020
• Number of nonempty subsets of {1,2,...,n} in which exactly 3/4 of the elements are <= (n-3)/3.at n=35A048031
• a(n) = Fibonacci(n)^2 * Fibonacci(n+1).at n=10A066258
• Number of (n+1) X (4+1) arrays of permutations of 0..n*5+4 with each element having index change +-(.,.) 0,0 1,2 or 2,2.at n=4A264014
• T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having index change +-(.,.) 0,0 1,2 or 2,2.at n=32A264017
• Number of (5+1)X(n+1) arrays of permutations of 0..n*6+5 with each element having index change +-(.,.) 0,0 1,2 or 2,2.at n=3A264020
• Number of (n+1) X (2+1) arrays of permutations of 0..n*3+2 with each element having index change +-(.,.) 0,0 1,2 or 2,-2.at n=12A264054
• Number of (n+1) X (2+1) arrays of permutations of 0..n*3+2 with each element having index change +-(.,.) 0,0 1,-2 or 2,-1.at n=8A264122
• a(n) is the smallest k such that the sum of the first k primes has exactly n prime factors, counting multiplicity.at n=19A385997