24881

Appears in sequences

• Numbers k such that sigma(k+2) = sigma(k).at n=29A007373
• Solutions to phi(x + omega(x)) = phi(x) + d(x), where phi() = A000010(), d() = A000005() and omega() = A001221().at n=7A063868
• Numbers k such that A065608(k) = A065608(k+2).at n=14A065064
• Convolution of A001045(n+1) (generalized (1,2)-Fibonacci), n >= 0, with itself.at n=12A073371
• Numbers m such that m and m+2 are both brilliant numbers, where brilliant numbers are semiprimes whose prime factors have an equal number of decimal digits, or whose prime factors are equal.at n=13A083284
• Floor(Zeta(3)^n).at n=54A125890
• a(n) = (n^5-n-10)/10.at n=12A131176
• Number of lower triangles of an (n+2) X (n+2) 0..2 array with new values introduced in row major order 0..2 and no element unequal to more than one horizontal or vertical neighbor.at n=10A194772
• Numbers k such that k and k+2 have the same number (A000005) and sum of divisors (A000203).at n=11A229254
• Triangular array read by rows: row n gives the coefficients of the polynomial p(n,x) defined in Comments.at n=56A249139
• Semiprimes whose prime factors are of equal binary length and which differ from each other in exactly three bit positions.at n=43A261075
• Composite numbers k such that the sum of their aliquot parts divides k+1.at n=12A306532
• a(n) is the second component y of the distance vector (x,y), x >= y >= 0, between two nodes of an infinite square lattice of one-ohm resistors, such that the resistance R between the two nodes is as close as possible to n ohms, i.e., abs(R - n) is minimized. x is A356201(n).at n=4A356202
• Numbers k such that the sum of the numbers from 1 to k and that from 1 to k+1 share the same sum of divisors.at n=17A375819
• Numbers k such that s(k) = s(k+2), where s(k) is the sum of odd divisors of k (A000593).at n=9A387920
• Numbers m such that Stern polynomial B(m,x) has no irreducible polynomial factors that themselves are Stern polynomials. The initial a(1) = 1 is included by convention.at n=33A389918