32292

Appears in sequences

• Indices of prime Cullen numbers: numbers k such that k*2^k + 1 is prime.at n=6A005849
• a(n) = T(2n,n), where T is the array in A026120.at n=7A026128
• a(n) = T(n,[ n/2 ] - 1), where T is the array in A026120.at n=14A026133
• Integers that are Rhonda numbers to base 16.at n=11A100975
• Rectified heptapeton (6-simplex) numbers: the coefficient of x^(2n-2) in (1+x+x^2+...+x^(n-1))^7.at n=8A179097
• Numbers n such that the sum of the first k divisors of n^2+1 is equal to n for some k.at n=8A194578
• Number of n X 6 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 1 0 1 vertically.at n=9A208377
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 115", based on the 5-celled von Neumann neighborhood.at n=35A270183
• Number of n-step self-avoiding walks on the honeycomb lattice with no non-contiguous adjacencies.at n=16A336758
• Ordered product of the terms in a primitive Pythagorean quadruple (with repetitions).at n=29A367737
• a(n) = sum of 2^(k-1) such that floor(n/prime(k)) is odd.at n=47A371906
• Numbers k such that (k*2^d + 1)*(d*2^k + 1) is semiprime for some divisor d of k.at n=17A382887
• a(n) is the number of possible choices for the first n terms of a "mean-central" sequence, where a monotonically increasing sequence of positive integers {b(n)} is called "mean-central" if for each positive integer k, the arithmetic mean of the first b(k) terms is exactly b(k).at n=29A383192