32763

Appears in sequences

• a(n) = 8^n - n.at n=5A024089
• Numbers having four 7's in base 8.at n=31A043452
• 2^(n-1) - (prime(n) mod n).at n=15A077686
• Number of binary rooted trees (every node has out-degree 0 or 2) with n labeled leaves (2n-1 nodes in all) and at most 2 distinct labels. Also the number of expressions in at most two variables constructible with n-1 instances of a single commutative and nonassociative binary operator.at n=10A083563
• Numbers k such that (k+j) mod (2+j) = 1 for j from 0 to 8 and (k+9) mod 11 <> 1.at n=11A096026
• Numbers that can be represented as both a^x+x and b^y-y, for some a, b, x, y > 1.at n=3A099226
• a(n) = 1 + sum{p=primes<n, p does not divide n} a(p).at n=49A112479
• 2^n - number of digits of 2^n.at n=15A139817
• Partial sums of A162255.at n=24A164053
• a(n) = 2^n - 5.at n=15A168616
• Monotonic ordering of nonnegative differences 8^i-5^j, for 40>= i>=0, j>=0.at n=21A192198
• Number of (n+1)X(1+1) 0..2 arrays x(i,j) with row sums sum{j^2*x(i,j), j=1..1+1} nondecreasing, and column sums sum{i^2*x(i,j), i=1..n+1} nondecreasing.at n=8A232780
• Number of partitions of n into two sorts of parts having exactly 2 parts of the second sort.at n=20A258472
• Decimal representation of the n-th iteration of the "Rule 245" elementary cellular automaton starting with a single ON (black) cell.at n=7A267924
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 465", based on the 5-celled von Neumann neighborhood.at n=36A272316
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 469", based on the 5-celled von Neumann neighborhood.at n=36A272418
• G.f.: Product_{i>=1, j>=1} 1/(1 - x^(i*j))^(i*j).at n=13A280540
• Array read by antidiagonals: T(n,k) is the number of binary rooted trees with n leaves of k colors and all non-leaf nodes having out-degree 2.at n=64A319539
• Denominators of convergents to Pi using best rational approximation whose denominator is between consecutive powers of 2: [2^n, 2^(n+1)-1], where n = 0, 1, 2, ...at n=14A325159
• a(n) = 2^(n-1) - tau(n) where tau(n) is the number of divisors of n.at n=15A349094