Sequences

392,541 sequences

a(n) = n-19.A023461
a(n) = n-19.
a(n) = n-20.A023462
a(n) = n-20.
a(n) = n-21.A023463
a(n) = n-21.
a(n) = n-22.A023464
a(n) = n-22.
a(n) = n-23.A023465
a(n) = n-23.
a(n) = n - 24.A023466
a(n) = n - 24.
a(n) = n-25.A023467
a(n) = n-25.
a(n) = n-26.A023468
a(n) = n-26.
a(n) = n-27.A023469
a(n) = n-27.
a(n) = n-28.A023470
a(n) = n-28.
a(n) = n-29.A023471
a(n) = n-29.
a(n) = n - 30.A023472
a(n) = n - 30.
a(n) = n-31.A023473
a(n) = n-31.
a(n) = n-32.A023474
a(n) = n-32.
a(n) = n-33.A023475
a(n) = n-33.
a(n) = n-34.A023476
a(n) = n-34.
a(n) = n-35.A023477
a(n) = n-35.
a(n) = n-36.A023478
a(n) = n-36.
a(n) = n-37.A023479
a(n) = n-37.
a(n) = n-38.A023480
a(n) = n-38.
a(n) = n-39.A023481
a(n) = n-39.
a(n) = n-40.A023482
a(n) = n-40.
a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 1) and d(n) = (n-th non-Fibonacci number).A023483
a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 1) and d(n) = (n-th non-Fibonacci number).
a(n) = b(n) + d(n), where b(n) = (n-th Lucas number) and d(n) = (n-th non-Fibonacci number).A023484
a(n) = b(n) + d(n), where b(n) = (n-th Lucas number) and d(n) = (n-th non-Fibonacci number).
a(n) = b(n) + d(n), where b(n) = (n-th Lucas number A000204 > 1) and d(n) = (n-th non-Fibonacci number).A023485
a(n) = b(n) + d(n), where b(n) = (n-th Lucas number A000204 > 1) and d(n) = (n-th non-Fibonacci number).
a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 2) and d(n) = (n-th non-Fibonacci number).A023486
a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 2) and d(n) = (n-th non-Fibonacci number).
a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 3) and d(n) = (n-th non-Fibonacci number).A023487
a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 3) and d(n) = (n-th non-Fibonacci number).
a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 2) and d(n) = (n-th number that is 1 or is not a Fibonacci number).A023488
a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 2) and d(n) = (n-th number that is 1 or is not a Fibonacci number).
Sum of n-th Lucas number greater than 3 and n-th number that is 1 or is not a Fibonacci number.A023489
Sum of n-th Lucas number greater than 3 and n-th number that is 1 or is not a Fibonacci number.
n-th non-Lucas number plus Fibonacci(n + 1).A023490
n-th non-Lucas number plus Fibonacci(n + 1).
a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 1) and d(n) = (n-th non-Lucas number).A023491
a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 1) and d(n) = (n-th non-Lucas number).
Duplicate of A022801.A023492
Duplicate of A022801.
a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 1) and d(n) = (n-th non-Lucas number).A023493
a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 1) and d(n) = (n-th non-Lucas number).
a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 2) and d(n) = (n-th non-Lucas number).A023494
a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 2) and d(n) = (n-th non-Lucas number).
a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 3) and d(n) = (n-th non-Lucas number).A023495
a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 3) and d(n) = (n-th non-Lucas number).
a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 2) and d(n) = (n-th number that is 1 or is not a Lucas number).A023496
a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 2) and d(n) = (n-th number that is 1 or is not a Lucas number).
a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 3) and d(n) = (n-th number that is 1 or is not a Lucas number).A023497
a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 3) and d(n) = (n-th number that is 1 or is not a Lucas number).
a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 3) and d(n) = (n-th number that is 1 or 2 or is not a Fibonacci number).A023498
a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 3) and d(n) = (n-th number that is 1 or 2 or is not a Fibonacci number).
a(n) = b(n) + d(n), where b(n) = ( (n+1)st Fibonacci number) and d(n) = (n-th number that is 1, 2, or 3, or is not a Lucas number).A023499
a(n) = b(n) + d(n), where b(n) = ( (n+1)st Fibonacci number) and d(n) = (n-th number that is 1, 2, or 3, or is not a Lucas number).
a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 1) and d(n) = (n-th number that is 1, 2, or 3, or is not a Lucas number).A023500
a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 1) and d(n) = (n-th number that is 1, 2, or 3, or is not a Lucas number).
a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 1) and d(n) = (n-th number that is 1, 2, or 3, or is not a Lucas number).A023501
a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 1) and d(n) = (n-th number that is 1, 2, or 3, or is not a Lucas number).
a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 2 ) and d(n) = (n-th number that is 1, 2, or 3, or is not a Lucas number).A023502
a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 2 ) and d(n) = (n-th number that is 1, 2, or 3, or is not a Lucas number).
Greatest prime divisor of prime(n) - 1.A023503
Greatest prime divisor of prime(n) - 1.
Maximum exponent in the prime factorization of prime(n) - 1.A023504
Maximum exponent in the prime factorization of prime(n) - 1.
Least odd prime divisor of prime(n) - 1, or 1 if prime(n) - 1 is a power of 2.A023505
Least odd prime divisor of prime(n) - 1, or 1 if prime(n) - 1 is a power of 2.
Exponent of 2 in prime factorization of prime(n) - 1.A023506
Exponent of 2 in prime factorization of prime(n) - 1.
a(n) = sum of distinct prime divisors of prime(n) - 1.A023507
a(n) = sum of distinct prime divisors of prime(n) - 1.
Sum of exponents in prime-power factorization of n-th prime - 1.A023508
Sum of exponents in prime-power factorization of n-th prime - 1.
Greatest prime divisor of prime(n) + 1.A023509
Greatest prime divisor of prime(n) + 1.
Greatest exponent in prime-power factorization of prime(n) + 1.A023510
Greatest exponent in prime-power factorization of prime(n) + 1.