47795

Appears in sequences

• Euler transform of Thue-Morse sequence A001285.at n=28A029877
• Numbers n such that 159*2^n-1 is prime.at n=25A050831
• Numbers k such that sigma(k) divides sigma(k+1), where sigma(k) is sum of positive divisors of k.at n=31A058072
• Numbers k such that sigma(k+1) = 2*sigma(k).at n=9A067081
• a(1) = 3, a(n) = a(n-1) + 4*(a(n-1)-floor(a(n-1)^(1/3))^3).at n=26A096297
• The PolyLog functional part of A008292 (the Eulerian numbers) is treated as a curvature to give a set of polynomial triangle sequence coefficients: p(x,n)=Sum[A008292(n,m)*x^(m-1),{m,0,n}]; q(x,n)=k from Solve[FullSimplify[ExpandAll[p[x, n]/(x - 1)^n]] - (1 + k/x^2) == 0, k].at n=56A146540
• Numbers that can be written in more than 1 way as p^2 + 3pq + q^2 with primes p < q.at n=21A218795
• Numbers k such that the average of the divisors of k and k+1 is the same.at n=15A238380
• a(n) = 5*(3*n+1)*(9*n+8)/2 (n>=0).at n=26A304508
• a(n) = one-half of the number of cells in the central rectangle of the graph described in row 2n+1 of A333288.at n=33A337640
• Indices of records in A360519.at n=60A361108
• Consecutive internal states of the linear congruential pseudo-random number generator (171*s + 11213) mod 53125 when started at 1.at n=33A385039