31862
domain: N
Appears in sequences
- Product of a prime and the previous number.at n=40A036689
- Numbers of the form 12*k + 2 with nonempty inverse totient set.at n=11A063668
- Deficient oblong numbers.at n=31A077804
- a(n) = smallest k such that (10^k-1)/9 == 0 mod prime(n)^2, or 0 if no such k exists.at n=40A087094
- Squarefree oblong (pronic) numbers having an odd number of prime factors.at n=24A098827
- Triangle T(n,m) = 2+A176697(n)-A176697(m)-A176697(n-m) read along rows 0<=m<=n.at n=58A176700
- a(n) = (7*n + 3)*(7*n + 4).at n=25A177071
- Multiplicative order of 2 modulo prime(n)^2 for n >= 2.at n=39A243905
- Numbers m such that gcd(A001008(m), m) > 1, in increasing order.at n=41A256102
- Index of the smallest Fibonacci number divisible by prime(n)^2.at n=40A264008
- Numbers n such that 2 * (1^n + 2^n + 3^n + ... + n^n) is not 0 (mod n), but 2 * (1^d + 2^d + 3^d + ... + d^d) is 0 (mod d) for each other d | n.at n=19A280187
- a(n) is the Pisano period of prime(n)^2.at n=40A343116
- Primitive terms of A108569.at n=23A346277
- Record values in A377059.at n=47A378029