24569

Appears in sequences

• Values of m in the discriminant D = -4*m leading to a new maximum of the L-function of the Dirichlet series L(1) = Sum_{k=1..oo} Kronecker(D,k)/k.at n=27A003420
• Smallest solution m to (n+1)*phi(m) = n*sigma(m), or -1 if no solution exists.at n=30A065824
• a(n) = A065824(A047845(n+1)).at n=13A065884
• a(n) is the unique odd positive solution x of 2^n = 7x^2+y^2.at n=38A077020
• Partial sums of A162396.at n=22A164120
• a(0)=1, a(1)=1; thereafter a(n) = -a(n-1) - 2*a(n-2).at n=37A169998
• a(n) = 5*a(n-1) - 8*a(n-2), with a(0)=0, a(1)=1.at n=13A190969
• Lucas pseudoprimes.at n=21A217120
• Strong Lucas pseudoprimes.at n=6A217255
• Expansion of (2 + x + x^2 + x^3 - x^4 - 2*x^5 - 4*x^6 - 8*x^7) / (1 - x^4 + 16*x^8) in powers of x.at n=39A247487
• a(n) = 3*a(n-1) - 4*a(n-2) with a(0) = a(1) = 1.at n=19A247560
• a(n) = 3*a(n-2) - 4*a(n-4) with a(0) = 2, a(1) = 1, a(2) = 3, a(3) = 1.at n=39A247564
• a(n) = largest number of distinct words arising in Post's tag system {00, 1101} applied to a binary word w, over all starting words w of length n, or a(n) = -1 if there is a word w with an unbounded trajectory.at n=31A284116
• a(n) = largest number of distinct words arising in Post's tag system {00, 1101} applied to a binary word w, over all starting words w of length n, or a(n) = -1 if there is a word w with an unbounded trajectory.at n=33A284116
• Addends k > 0 such that x^2 + k produces a new minimum of its Hardy-Littlewood Constant.at n=28A331949
• a(2*n) = 9*2^n - 7, a(2*n+1) = 3*2^(n+2) - 7.at n=23A354789