18452

Appears in sequences

• Number of cycles induced by iterating the Gray-coding of an n-bit number: a(n+1) = a(n) + 2^n/C_n, where C_n = least power of 2 >= n (C_n is the length of the cycle), with a(0) = 1.at n=19A007886
• Where 11^n occurs in n-almost-primes, starting at a(0)=1.at n=5A078846
• Numbers k such that 216*k+108 is a term of A097703 and A007494 and A098240.at n=17A098241
• a(n) = A100092(n^2+n+1).at n=13A100094
• a(n) = 19 + floor( Sum_{j=1..n-1} a(j) / 2 ).at n=17A120144
• First differences of A132581.at n=45A132582
• Number of n-member subsets of 1..2n whose elements sum to a multiple of n.at n=10A169888
• Number of Hamiltonian cycles in C_7 X P_n.at n=4A180583
• Number of (n+1)X(n+1) 0..1 arrays with every 2X2 subblock diagonal minus antidiagonal sum nondecreasing horizontally and vertically.at n=10A253151
• G.f.: Product_{k>=1} (1 - x^k)^(-k^(k-2)).at n=7A262842
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 137", based on the 5-celled von Neumann neighborhood.at n=31A270276
• Array read by antidiagonals: T(n,k) is the number of Hamiltonian cycles in the stacked prism graph P_n X C_k, n >= 1, k >= 2.at n=49A359855
• G.f. A(x) satisfies A(x) = 1 + x + x*(1 + x)^2*A(x)^3.at n=6A366239
• Array read by antidiagonals: T(n,k) is the index of prime(k)^n in the numbers with n prime factors, counted with multiplicity.at n=40A376479