20737

Appears in sequences

• a(n) = n^4 + 1.at n=12A002523
• Diagonals of Pascal's triangle mod 2 interpreted as binary numbers.at n=29A006921
• Cyclotomic polynomials at x=12.at n=8A019330
• Strong pseudoprimes to base 12.at n=14A020238
• Cyclotomic polynomials at x=-12.at n=8A020511
• Numbers whose square is palindromic in base 12.at n=23A029737
• Sums of distinct powers of 12.at n=17A033048
• Numbers k > 1 such that k mod ord2(k) is even, where ord2(k) is the order of 2 mod k.at n=30A036260
• Sums of 2 distinct powers of 12.at n=6A038492
• Numbers whose base-4 representation contains exactly four 0's and four 1's.at n=26A045037
• Numbers k such that k^3 is palindromic in base 12.at n=7A046245
• Numbers k such that the sum of the squares of the divisors of k is divisible by k.at n=30A046762
• a(n) = T(8,n), array T given by A048472.at n=9A048480
• Numbers n such that n^2 - 1 is expressible as the sum of two nonzero squares in exactly one way.at n=40A050797
• a(n) = Fibonacci(n)*Fibonacci(n+2).at n=11A059929
• a(1) = 1; a(n+1) = product of numerator and denominator in Sum_{k=1..n} 1/a(k).at n=7A064170
• Composite numbers m such that phi(m)*sigma(m) is divisible by m-1.at n=29A065149
• Numbers m such that DivisorSigma(4*k-2, m) mod m = 0 holds presumably for all k; that is, (4k-2)-power-sums of divisors of m are divisible by m for all k.at n=14A066290
• a(n) = n^phi(n) + 1.at n=11A066915
• Numbers k that divide phi(k)^2 + sigma(k)^2.at n=31A068484