48522

Appears in sequences

• Let b(1) = 2; and for n>= 2, if b(n-1) < prime(n) then b(n) = b(n-1) + prime(n) otherwise b(n) = b(n-1) - prime(n). The sequence gives the indices n where b(n-1) < b(n) < b(n+1).at n=10A135025
• Numbers k such that k and k^2 use only the digits 2, 3, 4, 5 and 8.at n=16A137069
• 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, -1), (0, 1, 1), (1, 0, 0)}.at n=10A149843
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 950", based on the 5-celled von Neumann neighborhood.at n=41A273829
• G.f. = ((2+3*x)/(1-x^2-x^3))^2.at n=23A350602