132096

Appears in sequences

• a(n) = Sum_{d|n} phi(n/d)^2*2^(d+1).at n=16A161217
• Numbers with 44 divisors.at n=22A175751
• Sum of prime anti-divisors of n = sum of prime anti-divisors of n+1 with n > 1.at n=17A192283
• a(n) = 2^x+2^y where p(n) is the n-th prime of the form 4*k+1 and x, y is the unique integer solution to p(n) = x^2+y^2.at n=35A226640
• Number of (n+1) X (3+1) 0..2 arrays with the upper median of every 2 X 2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=16A237632
• Bitmasks that can be used to generate a sequence of all positive integers up to 2^n.at n=16A246866
• Numbers n for which A019565(n) <= A087207(n) < n.at n=23A286612
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 214", based on the 5-celled von Neumann neighborhood.at n=20A286737
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 454", based on the 5-celled von Neumann neighborhood.at n=17A288396
• Triangle read by rows: T(n,k) = number of Ringel ladders of order n and genus k.at n=30A298800
• Numbers n such that each binary index k (from row n of A048793) has the same sum of binary indices A029931(k).at n=29A371732