32804

Appears in sequences

• Fibonacci sequence beginning 2, 32.at n=16A022378
• Numbers having four 8's in base 9.at n=4A043488
• Sequence of sums of alternating powers of 3.at n=17A079362
• Numbers of the form i*9^j-1 (i=1..8, j >= 0).at n=36A140576
• 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, -1), (-1, -1, 0), (-1, 0, -1), (1, 0, 1), (1, 1, 1)}.at n=8A150675
• Expansion of (1+2x-x^3+x^4)/(1-4x^2+3x^4).at n=18A181655
• a(n) = 4*(5*n^2 - 5*n + 1).at n=40A193448
• a(n) = 5*3^n-1.at n=8A198643
• a(n) = 5*9^n-1.at n=4A198962
• Numbers of the form 6^j + 8^k, for j and k >= 0.at n=32A226824
• Numbers k such that (14*10^k - 53) / 3 is prime.at n=24A280206
• Expansion of Product_{k>=1} (1 + x^k)^k / (1 + x^(4*k))^(4*k).at n=24A285292
• Number of parts in all partitions of n with largest multiplicity five.at n=33A320375
• Number of inseparable partitions of n; see Comments.at n=47A325535
• Numbers k such that psi(k) = psi(k + 2) and phi(k) = phi(k + 2), where psi(k) is the Dedekind psi function (A001615) and phi(k) is the Euler totient function (A000010).at n=7A330702
• Number of fundamentally different graceful labelings of the complete tripartite graph K_{1,1,n}.at n=15A339891
• If the Collatz trajectory of n reaches 1, say after k steps, and there is an integer m > n such that T^i(m) and T^i(n) have the same parity for i = 0..k (where T^i denotes the i-th iterate of the Collatz map A006370), then a(n) is the least such m, otherwise a(n) is -1.at n=35A348094
• Least b > 1 such that (b^(prime(n)^2) - 1)/(b^prime(n) - 1) is prime.at n=42A353101
• Records in A030000.at n=49A372044
• List of graphs that are squares, encoded as in A382754.at n=27A382761