172146

Appears in sequences

• s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Lucas numbers), t = A001950 (upper Wythoff sequence).at n=29A025095
• Values of n such that N=(an+1)(bn+1)(cn+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,35.at n=34A064254
• a(n) is the smallest number k such that GCD of n values of prime(j)-1 for successive j values starting with k is greater than 2.at n=11A080373
• a(n) is the smallest number k such that GCD of n values of prime(j)-1 for successive j values starting with k is greater than 2.at n=12A080373
• Numbers k such that L(2*k + 1) is prime, where L(m) is a Lucas number.at n=47A117522
• a(n) is the smallest k such that prime(k+i) = 1 (mod 6) for i = 0, 1,...,n-1.at n=11A247816
• a(n) is the smallest k such that prime(k+i) = 1 (mod 6) for i = 0, 1,...,n-1.at n=12A247816
• Index of the first prime which starts a run of n consecutive primes all congruent to each other mod 3 (or mod 6).at n=12A276414
• a(n) begins the first sequence of n consecutive positive integers with the same h-value and the same d-value in the Collatz (or '3x + 1') problem.at n=6A341362
• a(n) is the least k such that the residues mod 3 of the primes prime(k), prime(k+1),... include a string of n 1's followed by 2.at n=12A391807