Sequences
392,541 sequences
- a(n) = smallest number k such that both k-n and k+n are primes.A087711
a(n) = smallest number k such that both k-n and k+n are primes.
- a(1) = 1; if n = k-th prime, a(n) = k; otherwise write all prime factors of n in nondecreasing order, replace each prime with its rank, and concatenate the ranks.A087712
a(1) = 1; if n = k-th prime, a(n) = k; otherwise write all prime factors of n in nondecreasing order, replace each prime with its rank, and concatenate the ranks.
- Greatest prime factor of the product of the neighbors of the n-th prime.A087713
Greatest prime factor of the product of the neighbors of the n-th prime.
- Primes p = prime(i) such that p(i)# - p(i+1) and p(i)# + p(i+1) are both primes, where p# = A002110.A087714
Primes p = prime(i) such that p(i)# - p(i+1) and p(i)# + p(i+1) are both primes, where p# = A002110.
- Table read by rows where i-th row consists of primes P of the form P=j*P(i)# -1 or P=j*P(i)# +1 with 0 < j < P(i+1). Here P(r)# = A002110.A087715
Table read by rows where i-th row consists of primes P of the form P=j*P(i)# -1 or P=j*P(i)# +1 with 0 < j < P(i+1). Here P(r)# = A002110.
- Base-2 pseudoprimes (see A001567) of the form j*p(i)# - p(k) or j*p(i)# + p(k), p(i) and p(k) primes with p(i) < p(k) < p(i+1)^2 and 0 < j < p(i+1).A087716
Base-2 pseudoprimes (see A001567) of the form j*p(i)# - p(k) or j*p(i)# + p(k), p(i) and p(k) primes with p(i) < p(k) < p(i+1)^2 and 0 < j < p(i+1).
- Start with x=n, then iterate the map x -> A322982(x) with A322982(x)=2*x-1 if x is noncomposite, otherwise A322982(x) = A032742(x), the largest proper divisor of x. If this iteration leads to a fixed point then a(n) is the value of that fixed point. If the iteration leads to a cycle, a(n) is the smallest value in the cycle. If the iteration never becomes periodic then a(n)=0.A087717
Start with x=n, then iterate the map x -> A322982(x) with A322982(x)=2*x-1 if x is noncomposite, otherwise A322982(x) = A032742(x), the largest proper divisor of x. If this iteration leads to a fixed point then a(n) is the value of that fixed point. If the iteration leads to a cycle, a(n) is the smallest value in the cycle. If the iteration never becomes periodic then a(n)=0.
- Semiprimes with greater factor less than twice the smaller factor.A087718
Semiprimes with greater factor less than twice the smaller factor.
- Least number m such that the number of numbers k <= m with k > spf(k)^n exceeds the number of numbers with k <= spf(k)^n.A087719
Least number m such that the number of numbers k <= m with k > spf(k)^n exceeds the number of numbers with k <= spf(k)^n.
- Repeated terms in A005185.A087720
Repeated terms in A005185.
- Strictly increasing domain of A005185.A087721
Strictly increasing domain of A005185.
- Strictly decreasing domain set of A005185.A087722
Strictly decreasing domain set of A005185.
- Values that appear more than once in A087724 (related to the growth of PrimePi).A087723
Values that appear more than once in A087724 (related to the growth of PrimePi).
- a(n) = -PrimePi(n) +floor( prime(n)/log(n))-2.A087724
a(n) = -PrimePi(n) +floor( prime(n)/log(n))-2.
- Maximal number of moves required for the n X n generalization of the sliding block 15-puzzle (or fifteen-puzzle).A087725
Maximal number of moves required for the n X n generalization of the sliding block 15-puzzle (or fifteen-puzzle).
- Number of elements X in the matrix ring M_2(Z_n) such that X^2 == 0 mod n.A087726
Number of elements X in the matrix ring M_2(Z_n) such that X^2 == 0 mod n.
- Triangle read by rows: T(n,k) = (2 * (binomial(n,k)) * (n + 2 * k + 3)!)/((k + 1)! * (k + 2)! * (n + 3)!).A087727
Triangle read by rows: T(n,k) = (2 * (binomial(n,k)) * (n + 2 * k + 3)!)/((k + 1)! * (k + 2)! * (n + 3)!).
- Table read by rows where i-th row consists of primes P of the form P=(j*P(i)#)^2 +1 with 0 < j < P(i+1). Here P(i)# = A002110(i).A087728
Table read by rows where i-th row consists of primes P of the form P=(j*P(i)#)^2 +1 with 0 < j < P(i+1). Here P(i)# = A002110(i).
- Let X be the poset of finite subsets of the positive integers. The sequence is the number of downsets in X of cardinality n modulo equivalence by permutations of the positive integers.A087729
Let X be the poset of finite subsets of the positive integers. The sequence is the number of downsets in X of cardinality n modulo equivalence by permutations of the positive integers.
- Values of j for A087651 and A087732.A087730
Values of j for A087651 and A087732.
- Values of P for A087651.A087731
Values of P for A087651.
- Smaller of twin primes of the form P=j*P(i)#-1 and P=j*P(i)#+1 with 0 < j < P(i+1), where P(i) denotes i-th prime and P(i)# the i-th primorial number A002110(i).A087732
Smaller of twin primes of the form P=j*P(i)#-1 and P=j*P(i)#+1 with 0 < j < P(i+1), where P(i) denotes i-th prime and P(i)# the i-th primorial number A002110(i).
- Partial sums of A068639.A087733
Partial sums of A068639.
- a(n) = f(f(n)), where f() = A035327().A087734
a(n) = f(f(n)), where f() = A035327().
- Array read by antidiagonals: T(n,k) = o(n,k), where o(,) is a binary operation arising from counting the elements that are sums of m squares in a field of characteristic not equal to 2.A087735
Array read by antidiagonals: T(n,k) = o(n,k), where o(,) is a binary operation arising from counting the elements that are sums of m squares in a field of characteristic not equal to 2.
- Triangle T(n,k) read by rows given by [0, 1, 3, 6, 10, 15, 21, ...] DELTA [1, 3, 6, 10, 15, 21, 28,...] where DELTA is the operator defined in A084938.A087736
Triangle T(n,k) read by rows given by [0, 1, 3, 6, 10, 15, 21, ...] DELTA [1, 3, 6, 10, 15, 21, 28,...] where DELTA is the operator defined in A084938.
- Value of (n,n+1) concatenated in binary representation.A087737
Value of (n,n+1) concatenated in binary representation.
- Square array: T(n,k) gives n-th number a such that a^(2^k)+1 is prime (a generalized Fermat).A087738
Square array: T(n,k) gives n-th number a such that a^(2^k)+1 is prime (a generalized Fermat).
- a(1)=1; a(2)=2; for n > 2, a(n) satisfies a(S(n))=n and a(k)=n-1 for S(n-1) < k < S(n) where S(n) = a(1) + a(2) + ... + a(n).A087739
a(1)=1; a(2)=2; for n > 2, a(n) satisfies a(S(n))=n and a(k)=n-1 for S(n-1) < k < S(n) where S(n) = a(1) + a(2) + ... + a(n).
- a(n) = 1 + abs(A004001(A005185(n)) - A005185(A004001(n))).A087740
a(n) = 1 + abs(A004001(A005185(n)) - A005185(A004001(n))).
- a(n) = 1+Abs[A000040[A004001[n]]-A004001[A000040[n]]].A087741
a(n) = 1+Abs[A000040[A004001[n]]-A004001[A000040[n]]].
- a(n) = 1+Abs[Prime[A005185[n]]-A005185[Prime[n]]].A087742
a(n) = 1+Abs[Prime[A005185[n]]-A005185[Prime[n]]].
- Numbers m >= 3 with property that the remainder when m is divided by k (for 3 <= k <= m-2) is not 1.A087743
Numbers m >= 3 with property that the remainder when m is divided by k (for 3 <= k <= m-2) is not 1.
- Binary and decimal representation of n concatenated.A087744
Binary and decimal representation of n concatenated.
- Numbers A001317 repeated.A087745
Numbers A001317 repeated.
- Erroneous version of A023036.A087746
Erroneous version of A023036.
- Least number expressible as a sum of two distinct primes in exactly n ways.A087747
Least number expressible as a sum of two distinct primes in exactly n ways.
- Triangle formed by reading triangle of Stirling numbers of the first kind (A048994) mod 2.A087748
Triangle formed by reading triangle of Stirling numbers of the first kind (A048994) mod 2.
- Primes p such that 6^p - 5^p is composite.A087749
Primes p such that 6^p - 5^p is composite.
- Number of partitions of n into numbers having in binary representation at most trailing zeros.A087750
Number of partitions of n into numbers having in binary representation at most trailing zeros.
- Weighted sum of the harmonic numbers.A087751
Weighted sum of the harmonic numbers.
- Powers of 49.A087752
Powers of 49.
- a(n) = least k such that A005185(k)=n; or 0 if there is no such k.A087753
a(n) = least k such that A005185(k)=n; or 0 if there is no such k.
- a(n) = (C(2p,p)-2) / p^3, where p = prime(n).A087754
a(n) = (C(2p,p)-2) / p^3, where p = prime(n).
- Triangle read by rows: Stirling numbers of the first kind (A008275) mod 2.A087755
Triangle read by rows: Stirling numbers of the first kind (A008275) mod 2.
- a(n) = A087745(n+1).A087756
a(n) = A087745(n+1).
- Erroneous version of A088359.A087757
Erroneous version of A088359.
- Index of first occurrence of n in A005229.A087758
Index of first occurrence of n in A005229.
- Primes p such that 7^p - 6^p is composite.A087759
Primes p such that 7^p - 6^p is composite.
- Numbers n such that the sequence of k>=2 such that k^3 divides {binomial(n*k,k)-n} coincides exactly with the sequence of prime numbers.A087760
Numbers n such that the sequence of k>=2 such that k^3 divides {binomial(n*k,k)-n} coincides exactly with the sequence of prime numbers.