37056

Appears in sequences

• Numbers k such that 3^k - 2 is prime.at n=28A014224
• Product of a prime and the previous number.at n=43A036689
• a(n) = smallest k such that (10^k-1)/9 == 0 mod prime(n)^2, or 0 if no such k exists.at n=43A087094
• G.f. = theta_4(0,x^4)/theta_4(0,x).at n=30A103258
• Numbers representable in exactly two ways as (p-1)*p^e (where p is a prime and e >= 0) in ascending order.at n=20A114874
• a(n) = (p+2)!/p! where p is the n-th lesser twin prime, A001359(n).at n=13A126251
• a(n) = prime(prime(prime(A028815(n) - 1) - 1) - 1) - 1.at n=26A141133
• Number of permutations of floor(i*6/5), i=0..n-1, with all sums of 6 adjacent terms unique.at n=7A152375
• a(n) = 25*n^2 + 25*n + 6.at n=38A177059
• a(n) = (7*n + 3)*(7*n + 4).at n=27A177071
• E.g.f. satisfies: A(x) = x/(1 - tan(A(x))).at n=5A214224
• Numbers m such that gcd(A001008(m), m) > 1, in increasing order.at n=44A256102
• G.f.: Product_{k>=1} (1 + x^k) / (1 - x^(k*(k+1)/2)).at n=38A280422
• Numbers k such that k mod phi(k) = lambda(k).at n=31A290184
• Triangle T(n,k) read by rows: coefficients of polynomials P_n(t) defined in Formula section.at n=40A291844
• Multiplicative order of 5 (mod p^2), where p = prime(n), or 0 if 5 and p are not coprime.at n=43A305331
• Bitwise XOR of trajectories of rule 30 and rule 150, when both are started from a lone 1 cell: a(n) = A110240(n) XOR A038184(n).at n=8A327972
• Semiperimeter of the unique primitive Pythagorean triple whose inradius is the n-th odd prime and whose short leg is an even number.at n=41A380301