34322

Appears in sequences

• T(2n+1,n+4), T given by A026769.at n=6A026890
• Numbers k such that phi(k) + sigma(k) is a prime.at n=46A038344
• Numbers that are not squarefree and whose Euler totient function is squarefree.at n=33A049198
• Numbers k such that sigma(k)*phi(k) is squarefree.at n=21A065299
• a(n) = 2*prime(n)^2.at n=31A079704
• Number of (n,3) Freiman-Wyner sequences.at n=14A097925
• 2*p^2, for p an odd prime.at n=30A143928
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (0, 1, 1), (1, -1, 0), (1, 1, 0)}.at n=8A150440
• Numbers n such that the sum_i (d_i^i) of the i-th powers of their sorted divisors d_1< d_2<...< n is prime.at n=8A180852
• Numbers the sum of whose even divisors is 2 times a prime.at n=16A195334
• Numbers such that the difference between the sum of the even divisors and the sum of the odd divisors is prime.at n=19A195382
• Number of (n+2) X 4 binary arrays avoiding patterns 001 and 110 in rows, columns and nw-to-se diagonals.at n=25A202441
• Number of partitions of n such that the number of parts having multiplicity 1 is a part and the number of distinct parts is not a part.at n=45A241444
• Positions of record high water marks in A246024.at n=40A246026
• Composite numbers k such that Sum_{i=1..t-1} d(i+1)/d(i) is prime, where d(1), ..., d(t) are the divisors of k in ascending order.at n=30A255585
• a(n) is the smallest composite k such that d(2)/d(1) + d(3)/d(2) + ... + d(q)/d(q-1) = prime(n), where d(1) < d(2) < ... < d(q) are the q divisors of k, or 0 if no such k exists.at n=32A260901
• Even numbers such that the sum of the odd divisors is a prime p and the sum of the even divisors is 2p.at n=11A273459
• Where records occur in A070138.at n=32A298942
• Numbers k such that phi(k) == 2 (mod 12), where phi is the Euler totient function (A000010).at n=22A332511
• Record high values of A379248.at n=63A379294