41474

Appears in sequences

• a(0) = 1, a(n) = 32*n^2 + 2 for n > 0.at n=36A010021
• Numbers whose square is palindromic in base 12.at n=37A029737
• Numbers whose base-4 representation contains exactly four 0's and four 2's.at n=26A045061
• Numbers k such that the sum of the squares of the divisors of k is divisible by k.at n=36A046762
• 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=16A066290
• Sum of next n composite numbers.at n=40A072475
• Number of triples (a, b, c) with gcd(a, b, c) = 1 and -n <= a,b,c <= n.at n=18A175549
• For every positive integer m, let u(m) = (d(1),d(2),...,d(k)) be the unitary divisors of m. The sequence (a(n)) consists of successive numbers m which d(k)/d(1) + d(k-1)/d(2) + ... + d(k)/d(1) is an integer.at n=15A229996
• Numbers such that A017666(n) = A017668(n).at n=5A261989
• a(n) = a(n-1) + a(n-3) + a(n-4), where a(0) = 2, a(1) = 1, a(2) = 0, a(3) = 1.at n=24A295683
• Expansion of e.g.f. Product_{k>=1} (sec(x^k) + tan(x^k)).at n=7A330518
• a(n) = Sum_{d|n} phi(d)^4.at n=25A342470
• Numbers that are the sum of five fourth powers in four or more ways.at n=3A344354
• Numbers that are the sum of five fourth powers in exactly four ways.at n=3A344355
• Numbers k such that the sum of the squares of the odd divisors of k (A050999) is divisible by k.at n=21A355543
• a(n) = Fibonacci(4*n+2) + 3*Fibonacci(2*n+1)^2.at n=5A360467
• a(n) = [x^n] Product_{k=1..n} (x^(k^2) + 1 + 1/x^(k^2)).at n=16A369433
• a(n) = 2*a(n-1) + 2*a(n-2) - a(n-3), with a(0)=4, a(1)=6, a(2)=20.at n=10A374259