31595

Appears in sequences

• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = (primes).at n=43A024867
• a(n) = Sum_{k=0..floor(n/2)} T(n-k,k), T given by A026725.at n=21A026735
• Denominators of continued fraction convergents to sqrt(814).at n=10A042571
• Pseudo-random numbers: Davenport's generator for 32-bit integers.at n=22A084277
• 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, 0, 0), (0, 0, -1), (0, 1, -1), (1, 0, 1)}.at n=9A149320
• Number of nX6 1..3 arrays containing at least one of each value, all equal values connected, and rows considered as a single number in nondecreasing order.at n=2A166792
• Indices of records in A159918.at n=21A230097
• a(n) = smallest m such that wt(m^2) = n (where wt(i) = A000120(i)), or -1 if no such m exists.at n=24A231897
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 417", based on the 5-celled von Neumann neighborhood.at n=37A272018
• Numbers k for which rank of the elliptic curve y^2=x^3-k*x is 4.at n=22A309034
• a(n) is the least k such that k^2 has a maximal Hamming weight A357658(n) in the range 2^n <= k^2 < 2^(n+1).at n=27A357659
• a(n) is the largest k such that k^2 has a maximal Hamming weight A357658(n) in the range 2^n <= k^2 < 2^(n+1).at n=27A357660