41167

Appears in sequences

• Numbers n such that 49*2^n-1 is prime.at n=26A050550
• Consider the Diophantine equation x^3 + y^3 = z^3 + 1 (1<x<y<z) or 'Fermat near misses'. Arrange solutions by increasing values of z (see A050791), and increasing values of y in case of ties. Sequence gives values of y.at n=26A050793
• Expansion of exp( Sum_{n >= 1} R(n,u)*x^n/n ), where R(n,u) denotes the n-th row polynomial of A086646.at n=32A255905
• Number of length n arrays of permutations of 0..n-1 with each element moved by -2 to 2 places and every three consecutive elements having its maximum within 3 of its minimum.at n=24A263691
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 177", based on the 5-celled von Neumann neighborhood.at n=38A270620