32775

Appears in sequences

• a(n) = n + n*(n-1)*(n-2)*(n-3).at n=15A001094
• Number of terms in n-th derivative of a function composed with itself 8 times.at n=9A024208
• Numbers having four 0's in base 8.at n=13A043424
• Matrix 8th power of partition triangle A008284.at n=36A050302
• Odd numbers k such that the number of 1's in binary representation of k equals omega(k), the number of distinct primes in the factorization of k.at n=28A071595
• a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is a power of 2".at n=45A079256
• a(n) is the closest number to 2^n which is divisible by n.at n=14A082894
• Sum of absolute values of lists created by n substitutions k -> Range[ -Abs[k+1],Abs[k-1],2] starting with {1}.at n=10A084079
• a(n) = n^3 + 7.at n=32A084377
• a(1) = 11; a(n) = if n == 2 mod 3 then a(n-1)-3, if n == 0 mod 3 then a(n-1)-2, if n == 1 mod 3 then a(n-1)*2.at n=46A085688
• a(n) = n*(4*n^2+5*n-3)/2.at n=24A126335
• a(n) = smallest multiple of n which is >= 2^n.at n=14A128093
• Terms in A046034 which are pairwise products of terms in A046034.at n=30A153446
• Half the number of length n integer sequences with sum zero and sum of squares 338.at n=4A157545
• Number of "ON" cubic cells at n-th stage in simple 3-dimensional cellular automaton: a(n) = A160428(n)/8.at n=33A161342
• a(n) = 2^n + 7.at n=15A168415
• a(n) = 2*4^n + 7.at n=7A193579
• Number of n X 5 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 1 and 1 1 0 vertically.at n=6A207700
• Number of 7Xn 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 1 and 1 1 0 vertically.at n=4A207708
• Number of terms in 9th derivative of a function composed with itself n times.at n=7A215627