36290

Appears in sequences

• a(n) = n*(n + 1)*(n^2 + n + 2)/4.at n=19A001621
• a(0) = 1, a(n) = 28*n^2 + 2 for n>0.at n=36A010018
• Coordination sequence for A_19 lattice.at n=2A035845
• Product of a prime and the previous number.at n=42A036689
• Numbers of the form 12*k + 2 with nonempty inverse totient set.at n=12A063668
• Largest possible z-value of an integer solution (x,y,z) to 4/n = 1/x + 1/y + 1/z satisfying 0 < x < y < z. The x and y components are in A075245 and A075246.at n=35A075247
• Deficient oblong numbers.at n=33A077804
• Number of triples (a, b, c) with gcd(a, b, c) = 1 and -n <= a,b,c <= n.at n=17A175549
• Number of length n 1..(4+2) arrays with no leading or trailing partial sum equal to a prime and no consecutive values equal.at n=10A254214
• Numbers m such that gcd(A001008(m), m) > 1, in increasing order.at n=43A256102
• z-value of the lexicographically first solution (x,y,z) of 4/n = 1/x + 1/y + 1/z with 0 < x < y < z all integers, or 0 if there is no such solution. Corresponding x and y values are in A257839 and A257840.at n=37A257841
• Index of the smallest Fibonacci number divisible by prime(n)^2.at n=42A264008
• Oblong numbers n such that n - 1 and n + 1 are both semiprime.at n=35A276565
• 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=20A280187
• a(n) is the Pisano period of prime(n)^2.at n=42A343116
• Oblong numbers which are products of four distinct primes.at n=34A358988