129792

Appears in sequences

• a(n) = 2^(2n+3) - 2^n*(n+3).at n=8A008464
• a(n) = Sum_{k=1..9} a(n-k); a(8) = 1, a(n) = 0 for n < 8.at n=26A104144
• If an array is made of columns of -nacci sequences, fibo-, tribo- etc. all starting w. 1,1,2 etc, the NW to SE diagonals can be extended by computation. The above is diagonal 11. See A159741 for details.at n=7A159748
• G.f. satisfies: A(x) = 1 + Sum_{n>=1} q^(2n-1)/(1 - q^(2n-1)) where q = x*A(x).at n=11A190790
• Positive integers, c, such that there are more than two solutions to the equation a^2 + b^3 = c^4, with a, b > 0.at n=50A242381
• The number of zeroless decimal numbers whose digital sum is n.at n=18A258800
• Number of nX6 0..2 arrays with every repeated value in every row not one larger and in every column one larger mod 3 than the previous repeated value, and upper left element zero.at n=1A268091
• T(n,k)=Number of nXk 0..2 arrays with every repeated value in every row not one larger and in every column one larger mod 3 than the previous repeated value, and upper left element zero.at n=22A268092
• Number of 2 X n 0..2 arrays with every repeated value in every row not one larger and in every column one larger mod 3 than the previous repeated value, and upper left element zero.at n=5A268094
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 51", based on the 5-celled von Neumann neighborhood.at n=16A285563
• Number of separable multisets of size n covering an initial interval of positive integers.at n=18A336103
• Number of multisets of size n that have an alternating permutation and cover an initial interval of positive integers.at n=18A349055
• Number of compositions (ordered partitions) of n into parts not greater than n/2.at n=18A368484
• Indices of record high points in A386487.at n=32A387519