10749957122
domain: N
Appears in sequences
- Bisection of Lucas numbers: a(n) = L(2*n) = A000032(2*n).at n=24A005248
- a(n) = L(L(n+1)+1), where L(n) are Lucas numbers A000032.at n=7A005372
- Even Lucas numbers: a(n) = L(3*n).at n=16A014448
- a(n) = Lucas(4*n).at n=12A056854
- Lucas(6*n): a(n) = 18*a(n-1) - a(n-2), starting with a(0) = 2 and a(1) = 18.at n=8A087215
- Lucas numbers L(8*n).at n=6A087265
- Lucas numbers L(12n).at n=4A089775
- Lucas numbers for which the sum of the digits is also a Lucas number.at n=9A117764
- Lucas numbers for which the product of the digits is a Fibonacci number.at n=23A117769
- Lucas numbers for which the sum of the digits is a prime.at n=15A117790
- Nonprime Lucas numbers.at n=33A172159
- Logarithmic derivative of the squares of the Fibonacci numbers (A007598, with offset).at n=23A173661
- a(0) = 2, a(n) = Lucas(phi(n^2)) for n > 0.at n=12A197190
- Alternating row sums of Riordan triangle A110162.at n=24A219233
- A modified Engel expansion of the golden ratio (1/2)*(1 + sqrt(5)) (A001622).at n=16A220398
- Optimal ascending continued fraction expansion of phi-1 = 1/phi = (sqrt(5)-1)/2.at n=5A228933
- Smallest Lucas number L(m) > L(n) that is divisible by the n-th Lucas number L(n) = A000204(n).at n=15A245580
- Numbers n such that n^2 + 1 is the product of three distinct Fibonacci numbers > 1.at n=22A245688