Sequences
392,541 sequences
- Numbers k such that k! + k# - 1 is prime, where k# is the primorial function A034386(k).A081711
Numbers k such that k! + k# - 1 is prime, where k# is the primorial function A034386(k).
- Numbers k such that k! - k# + 1 is prime, where k# is the primorial function.A081712
Numbers k such that k! - k# + 1 is prime, where k# is the primorial function.
- n! - n# - 1 is prime, where n# is the primorial function.A081713
n! - n# - 1 is prime, where n# is the primorial function.
- a(n) = F(n)*L(n+1) where F=Fibonacci and L=Lucas numbers.A081714
a(n) = F(n)*L(n+1) where F=Fibonacci and L=Lucas numbers.
- Numbers n such that 3^n+2 is a semiprime.A081715
Numbers n such that 3^n+2 is a semiprime.
- Smallest number x such that phi(x)=A000010(x) has exactly n different decimal digits.A081716
Smallest number x such that phi(x)=A000010(x) has exactly n different decimal digits.
- Primes prime(j) such that prime(j) + j is composite.A081717
Primes prime(j) such that prime(j) + j is composite.
- Array T(n,m) read by antidiagonals, where T(n,m) = number of n X infinity multiplicity integer partition (mip) matrix of m (n >= 0, m >= 0).A081718
Array T(n,m) read by antidiagonals, where T(n,m) = number of n X infinity multiplicity integer partition (mip) matrix of m (n >= 0, m >= 0).
- Triangle T(n,k) read by rows, related to Faà di Bruno's formula (n >= 0 and 0 <= k <= n).A081719
Triangle T(n,k) read by rows, related to Faà di Bruno's formula (n >= 0 and 0 <= k <= n).
- Triangle T(n,k) read by rows, giving number of bracelets (turnover necklaces) with n beads of k colors (n >= 1, 1 <= k <= n).A081720
Triangle T(n,k) read by rows, giving number of bracelets (turnover necklaces) with n beads of k colors (n >= 1, 1 <= k <= n).
- Number of bracelets of n beads in up to n colors.A081721
Number of bracelets of n beads in up to n colors.
- Row sums of triangle in A081720.A081722
Row sums of triangle in A081720.
- Let b(n)=floor((3/2)^n), c(n)=floor((4/3)^n); sequence gives values of k such that b(k+1) / b(k) = 3/2 and c(k+1) / c(k) = 4/3.A081723
Let b(n)=floor((3/2)^n), c(n)=floor((4/3)^n); sequence gives values of k such that b(k+1) / b(k) = 3/2 and c(k+1) / c(k) = 4/3.
- Let b(n)=floor((3/2)^n), c(n)=floor((4/3)^n), d(n)=floor((5/4)^n); sequence gives values of n such that b(n+1)/b(n)=3/2, c(n+1)/c(n)=4/3 and d(n+1)/d(n)=5/4.A081724
Let b(n)=floor((3/2)^n), c(n)=floor((4/3)^n), d(n)=floor((5/4)^n); sequence gives values of n such that b(n+1)/b(n)=3/2, c(n+1)/c(n)=4/3 and d(n+1)/d(n)=5/4.
- a(n) = A065560(n) + n - prime(n).A081725
a(n) = A065560(n) + n - prime(n).
- Let f(x,y)=floor((1+1/y)^x); sequence gives least k such that f(k+2,n)/f(k,n)=(1+1/n)^2.A081726
Let f(x,y)=floor((1+1/y)^x); sequence gives least k such that f(k+2,n)/f(k,n)=(1+1/n)^2.
- Length of periods of Euler numbers modulo n.A081727
Length of periods of Euler numbers modulo n.
- Length of periods of Euler numbers modulo prime(n).A081728
Length of periods of Euler numbers modulo prime(n).
- Expansion of Sum(k>=0, x^(2^k)) + 1/(1+x). First differences of A007456 (gossip sequence) for n>1.A081729
Expansion of Sum(k>=0, x^(2^k)) + 1/(1+x). First differences of A007456 (gossip sequence) for n>1.
- Numbers k such that the k-th Euler number == 1 (mod k).A081730
Numbers k such that the k-th Euler number == 1 (mod k).
- a(n) = (A000364(n+2)-A000364(n))/60.A081731
a(n) = (A000364(n+2)-A000364(n))/60.
- Number of numbers that differ from n in ternary representation by exactly one edit-operation: deletion, insertion, or substitution.A081732
Number of numbers that differ from n in ternary representation by exactly one edit-operation: deletion, insertion, or substitution.
- Triangle read by rows, T(n,k) = 2^(n-k)*[x^k] Euler_polynomial(n, x), for n >= 0, k >= 0.A081733
Triangle read by rows, T(n,k) = 2^(n-k)*[x^k] Euler_polynomial(n, x), for n >= 0, k >= 0.
- First and smallest sequence of 6 consecutive primes in arithmetic progression.A081734
First and smallest sequence of 6 consecutive primes in arithmetic progression.
- Numbers k such that the k-th Motzkin number == 1 (mod k).A081735
Numbers k such that the k-th Motzkin number == 1 (mod k).
- Numbers n such that n is not an odd prime and not a square of prime and the n-th Motzkin number == 1 (mod n).A081736
Numbers n such that n is not an odd prime and not a square of prime and the n-th Motzkin number == 1 (mod n).
- a(n) = (n-1)*10 + n-th decimal digit of Pi=3.14159...A081737
a(n) = (n-1)*10 + n-th decimal digit of Pi=3.14159...
- a(n) = Sum_{2 <= p <= n, p prime} p^2.A081738
a(n) = Sum_{2 <= p <= n, p prime} p^2.
- a(n) = (-1/2^n)*(A000367(2^n)+1).A081739
a(n) = (-1/2^n)*(A000367(2^n)+1).
- 11-level labeled rooted trees with n leaves.A081740
11-level labeled rooted trees with n leaves.
- Numbers k that divide A005554(k) (the sum of consecutive Motzkin numbers).A081741
Numbers k that divide A005554(k) (the sum of consecutive Motzkin numbers).
- a(1)=1; then if n is a multiple of 3, a(n) = a(n/3) + 1; if n is not a multiple of 3 but even, a(n) = a(n/2) + 1; a(n) = a(n-1) + 1 otherwise.A081742
a(1)=1; then if n is a multiple of 3, a(n) = a(n/3) + 1; if n is not a multiple of 3 but even, a(n) = a(n/2) + 1; a(n) = a(n-1) + 1 otherwise.
- a(1)=1 then a(n)=a(n/2^k)+1 if n is even and 2^k is the largest power of 2 dividing n, a(n)=a(n-1) otherwise.A081743
a(1)=1 then a(n)=a(n/2^k)+1 if n is even and 2^k is the largest power of 2 dividing n, a(n)=a(n-1) otherwise.
- Erroneous version of A087316.A081744
Erroneous version of A087316.
- a(n) = A080901(n) - n.A081745
a(n) = A080901(n) - n.
- a(1)=1; for n>1, a(n)=a(n-1)-3 if n is already in the sequence, a(n)=a(n-1)+5 otherwise.A081746
a(1)=1; for n>1, a(n)=a(n-1)-3 if n is already in the sequence, a(n)=a(n-1)+5 otherwise.
- a(n) = A081746(n) - n.A081747
a(n) = A081746(n) - n.
- a(n) = (A081746(n) - n)/4.A081748
a(n) = (A081746(n) - n)/4.
- Continued fraction for e/5.A081749
Continued fraction for e/5.
- Simple continued fraction of 2*e.A081750
Simple continued fraction of 2*e.
- a(n) is the smallest number that is precisely n-tuply abundant.A081751
a(n) is the smallest number that is precisely n-tuply abundant.
- Ordered product of the sides of primitive Pythagorean triangles divided by 60.A081752
Ordered product of the sides of primitive Pythagorean triangles divided by 60.
- a(n) = floor(n/12) if n == 2 (mod 12); a(n) = floor(n/12) + 1 otherwise.A081753
a(n) = floor(n/12) if n == 2 (mod 12); a(n) = floor(n/12) + 1 otherwise.
- Numbers k such that the number of noncongruent solutions to x^(2^m) == 1 (mod k) is the same for any m>=1.A081754
Numbers k such that the number of noncongruent solutions to x^(2^m) == 1 (mod k) is the same for any m>=1.
- Number of noncongruent solutions to x^(2^m) == 1 (mod n) when n is such that the number of solutions is the same for any m>=1.A081755
Number of noncongruent solutions to x^(2^m) == 1 (mod n) when n is such that the number of solutions is the same for any m>=1.
- Numbers k such that there is a proper divisor d of k satisfying sigma(d)=k.A081756
Numbers k such that there is a proper divisor d of k satisfying sigma(d)=k.
- Number of ways to write n as i*j+i-j, 0<i<j<=n.A081757
Number of ways to write n as i*j+i-j, 0<i<j<=n.
- Sum of prime factors (with repetition) of sum of prime factors (with repetition) of n.A081758
Sum of prime factors (with repetition) of sum of prime factors (with repetition) of n.
- Numbers k such that 5*k+6 is prime.A081759
Numbers k such that 5*k+6 is prime.
- Decimal expansion of Gamma(1/3)*Gamma(5/6)/Gamma(1/6).A081760
Decimal expansion of Gamma(1/3)*Gamma(5/6)/Gamma(1/6).