32641

Appears in sequences

• Expansion of 1/((1-5x)(1-6x)(1-9x)).at n=4A019793
• Product representation of the Pell numbers A000129 and A002203.at n=20A072280
• a(n) = 2^(n-1)*(2^n - 1) + 1.at n=8A134169
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (0, -1, 0), (1, -1, -1), (1, 1, 1)}.at n=9A149508
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (0, 1, 1), (1, -1, 0), (1, 1, 0)}.at n=8A150438
• a(n) = abs(2^n-127).at n=15A176303
• Hilltop maps: number of n X 3 binary arrays indicating the locations of corresponding elements not exceeded by any king-move neighbor in a random 0..2 n X 3 array.at n=4A218314
• Hilltop maps: number of nX5 binary arrays indicating the locations of corresponding elements not exceeded by any king-move neighbor in a random 0..2 nX5 array.at n=2A218316
• T(n,k)=Hilltop maps: number of nXk binary arrays indicating the locations of corresponding elements not exceeded by any king-move neighbor in a random 0..2 nXk array.at n=23A218319
• T(n,k)=Hilltop maps: number of nXk binary arrays indicating the locations of corresponding elements not exceeded by any king-move neighbor in a random 0..2 nXk array.at n=25A218319
• Hilltop maps: number of nX3 binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, vertical or antidiagonal neighbor in a random 0..3 nX3 array.at n=4A218367
• Hilltop maps: number of nX5 binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, vertical or antidiagonal neighbor in a random 0..3 nX5 array.at n=2A218369
• T(n,k)=Hilltop maps: number of nXk binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, vertical or antidiagonal neighbor in a random 0..3 nXk array.at n=23A218372
• T(n,k)=Hilltop maps: number of nXk binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, vertical or antidiagonal neighbor in a random 0..3 nXk array.at n=25A218372
• Numbers k such that 2^(k-1)*(2^k - 1) + 1 is prime (see A134169).at n=26A268692
• a(n) = a(n-1) + a(n-2) + 2 a([(n-1)/2]), where a(0) = 1, a(1) = 1, a(2) = 1.at n=20A298354
• Number of semi-lone-child-avoiding locally disjoint rooted trees with n unlabeled leaves.at n=9A331874
• a(n) = Sum_{j=1..n} Sum_{k=1..n} phi(j*k) / phi(k).at n=43A372636