39914

Appears in sequences

• a(n) is the solution to the postage stamp problem with 4 denominations and n stamps.at n=41A001209
• Number of binary strings of length n with equal numbers of 00010 and 11000 substrings.at n=16A164224
• G.f. A(x) satisfies: [x^n] A_{n}(x) = [x^n] A_{n+1}(x) for n>2 where A_{n+1}(x) = A_{n}(A(x)) denotes iteration with A_0(x)=x.at n=5A177776
• G.f.: Sum_{n>=1} moebius(n)*x^n/(1 - A002203(n)*x^n + (-1)^n*x^(2*n)), where A002203 is the companion Pell numbers.at n=13A204385
• Number of Sidon subsets of {1,...,n} of size 5.at n=28A241689