22446

Appears in sequences

• a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2 and a(3) = 4.at n=15A049914
• a(n) = ceiling(x(n)), where x(n) = 3*x(n-1)/2 and x(1) = 1.at n=23A117590
• G.f.: Sum_{n>=0} x^n/(1-x)^(5*n) * Sum_{k=0..n} C(n,k)^2 * x^k.at n=7A249793
• Number of binary min heaps on [n] that give a max heap when reversed.at n=14A273755
• Numbers equal to the sum of three oblong numbers in arithmetic progression.at n=44A292314
• a(n) = 2*n^3 - 4*n^2 + 10*n - 2 (n>=1).at n=22A304161
• Number of nX4 0..1 arrays with every element unequal to 0, 1, 2, 3, 6 or 7 king-move adjacent elements, with upper left element zero.at n=6A306049
• Number of nX7 0..1 arrays with every element unequal to 0, 1, 2, 3, 6 or 7 king-move adjacent elements, with upper left element zero.at n=3A306052
• T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 3, 6 or 7 king-move adjacent elements, with upper left element zero.at n=48A306053
• T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 3, 6 or 7 king-move adjacent elements, with upper left element zero.at n=51A306053
• Number of ways to write n as an ordered sum of nine positive Fibonacci numbers (with a single type of 1).at n=12A357717
• Number of Dyck excursions with catastrophes from (0,0) to (n,0).at n=12A369432
• Numbers k that divide the k-th large Schröder number.at n=40A372902
• Triangle read by rows: T(n,k) is the number of irreducible words covering the alphabet [n] such that the maximal cardinality of C is k, where C is a subset of the alphabet such that all letters in C appear in weakly increasing order within the word.at n=40A390670