32192

Appears in sequences

• a(n) = 2^n - C(n,0) - C(n,1) - C(n,2) - C(n,3).at n=15A002663
• a(n) = 2^(2n+3) - 2^n*(n+3).at n=7A008464
• a(n) is the concatenation of n and 6n.at n=31A009440
• Shallit sequence S(14,23), a(n)=[ a(n-1)^2/a(n-2)+1 ].at n=15A010923
• Numbers k such that 141*2^k+1 is prime.at n=46A032420
• Numbers k > 1 such that, in base 6, k and k^2 contain the same digits in the same proportion.at n=16A061660
• Octanacci numbers: a(0)=a(1)=...=a(6)=0, a(7)=1; for n >= 8, a(n) = Sum_{i=1..8} a(n-i).at n=23A079262
• a(n) = n^5 - n^3 - n^2.at n=8A133070
• Number of planar n X n X n binary triangular grids with no more than 11 ones in any 5 X 5 X 5 subtriangle.at n=5A153545
• Number of planar n X n X n binary triangular grids with no more than 11 ones in any similarly oriented 5 X 5 X 5 subtriangle.at n=5A153573
• 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 10. See A159741 for details.at n=6A159747
• Given M = triangle A122196 as an infinite lower triangular matrix, this sequence is lim_{k->infinity} M^k.at n=34A171238
• Sums of least knight's moves from (0,0) to points in the square lattice [-n,n]x[-n,n].at n=27A183047
• a(n) = Sum_{k=0..11} C(n, k).at n=15A219531
• The generalized Conway-Guy sequence d_2(n).at n=10A225178
• Number of separable multisets of size n covering an initial interval of positive integers.at n=16A336103
• Number of multisets of size n that have an alternating permutation and cover an initial interval of positive integers.at n=16A349055
• Number of compositions (ordered partitions) of n into parts not greater than n/2.at n=16A368484