103679

Appears in sequences

• Number of strict (-1)st-order maximal independent sets in cycle graph.at n=23A007390
• a(n) = Lucas(n+2) - 3.at n=21A027961
• Primeval numbers: numbers that set a record for the number of distinct primes that can be obtained by permuting some subset of their digits.at n=28A072857
• a(n) = Lucas(4n) - 3, or Lucas(2n-1)*Lucas(2n+1).at n=5A081078
• Triangle read by rows giving the coefficients of general sum formulas of n-th Subfactorial numbers (A000166). The k-th row (k>=1) contains T(i,k) for i=1 to 2*k-1, where T(i,k) satisfies Subf(n) = Sum_{k=1..n} Sum_{i=1..2*k-1} T(i,k) * C(n-k,i-1) * n^(n-k).at n=38A101560
• a(n) = 80*n^2 - 1.at n=35A158774
• a(n) = 5*12^n - 1.at n=4A199107
• A variant of primeval numbers A072857 where primes are counted with repetition as in A075053, not as in A039993.at n=30A239196
• a(n) = gcd(Sum_{k=1...n} L(k), Product_{j=1...n} L(j)), where L(k) is the k-th Lucas number.at n=21A239799
• Numbers such that antisigma(n) mod sigma(n) = phi(n), where antisigma(n) is the sum of the numbers less than n that do not divide n, sigma(n) is the sum of the divisors of n and phi(n) is the Euler totient function of n.at n=15A272338
• a(n) = L(n)^2 - 5*(-1)^n = L(n+1)*L(n-1), where L = A000032.at n=12A292696
• Determinant of the matrix [L(j+k) + d(j,k)]_{1<=j, k<=n}, where L(n) denotes the Lucas number A000032(n), and d(j,k) is 1 or 0 according as j = k or not.at n=10A360278