25961

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 = (F(2), F(3), F(4), ...), t = A000201 (lower Wythoff sequence).at n=25A025107
• Number of points in Z^n of norm <= 2.at n=15A055426
• Pseudo-random numbers: Davenport's generator for 32-bit integers.at n=6A084277
• Triangle of numerators in the square of the matrix A[i,j] = 1/i for j <= i, 0 otherwise.at n=59A119947
• Numbers k that divide the sum of digits of 13^k.at n=44A175525
• Numerator of h(n+7) - h(n), where h(n) = Sum_{k=1..n} 1/k.at n=4A192449
• Discriminants of totally real cubic fields in which every norm-positive unit is totally positive.at n=2A329769
• a(n) = Sum_{k=0..n} binomial(n+5*k+5,k).at n=4A390389