Sequences
392,541 sequences
- a(n) = (prime(n) - 1) mod n.A087611
a(n) = (prime(n) - 1) mod n.
- A divisibility sequence derived from Lehmer's polynomial x^10+x^9-x^7-x^6-x^5-x^4-x^3+x+1. Square root of the terms in A059928.A087612
A divisibility sequence derived from Lehmer's polynomial x^10+x^9-x^7-x^6-x^5-x^4-x^3+x+1. Square root of the terms in A059928.
- Number of labeled acyclic preferences/voting outcomes, indifference and undecidedness/incompleteness permitted (Social Choice Theory).A087613
Number of labeled acyclic preferences/voting outcomes, indifference and undecidedness/incompleteness permitted (Social Choice Theory).
- Number of unlabeled acyclic preferences/voting outcomes, indifference and undecidedness/incompleteness permitted (Social Choice Theory).A087614
Number of unlabeled acyclic preferences/voting outcomes, indifference and undecidedness/incompleteness permitted (Social Choice Theory).
- Number of labeled cyclic preferences/voting outcomes, indifference and undecidedness/incompleteness permitted (Social Choice Theory).A087615
Number of labeled cyclic preferences/voting outcomes, indifference and undecidedness/incompleteness permitted (Social Choice Theory).
- Number of unlabeled cyclic preferences/voting outcomes, indifference and undecidedness/incompleteness permitted (Social Choice Theory).A087616
Number of unlabeled cyclic preferences/voting outcomes, indifference and undecidedness/incompleteness permitted (Social Choice Theory).
- Gabcke sequence: a(0)=1; (n+1) a(n+1) = Sum_{k=0..n} 2^(4k+1) |E(2k+2)| a(n-k), where |E(2k+2)| are Euler numbers (E(2k)=(-1)^k A000364(k)).A087617
Gabcke sequence: a(0)=1; (n+1) a(n+1) = Sum_{k=0..n} 2^(4k+1) |E(2k+2)| a(n-k), where |E(2k+2)| are Euler numbers (E(2k)=(-1)^k A000364(k)).
- a(n) is the number of pair of consecutive numbers (k,k+1) with k<=10^n such that k and k+1 are both squarefree.A087618
a(n) is the number of pair of consecutive numbers (k,k+1) with k<=10^n such that k and k+1 are both squarefree.
- a(n) = 137*a(n-1) + a(n-2), with a(0) = 2 and a(1) = 137.A087619
a(n) = 137*a(n-1) + a(n-2), with a(0) = 2 and a(1) = 137.
- #{0<=k<=n: k*n is divisible by 4}.A087620
#{0<=k<=n: k*n is divisible by 4}.
- (1,1) entry of powers of the orthogonal design shown below.A087621
(1,1) entry of powers of the orthogonal design shown below.
- Order of letters on Dvorak typewriter (or computer) keyboard.A087622
Order of letters on Dvorak typewriter (or computer) keyboard.
- Square array A(n,k) = the cardinality of the set {x in [1,k-1] : gcd(x,k)=n}, read by rising antidiagonals.A087623
Square array A(n,k) = the cardinality of the set {x in [1,k-1] : gcd(x,k)=n}, read by rising antidiagonals.
- a(n)=0 if n is prime, A001221(n) otherwise.A087624
a(n)=0 if n is prime, A001221(n) otherwise.
- Number of primes in the ring Z_n.A087625
Number of primes in the ring Z_n.
- Expansion of 2/(1-2x+sqrt(1-4x+4x^3)).A087626
Expansion of 2/(1-2x+sqrt(1-4x+4x^3)).
- Count ...n,2n,2n...A087627
Count ...n,2n,2n...
- Generalized Jacobsthal sequence.A087628
Generalized Jacobsthal sequence.
- Generalized Jacobsthal sequence.A087629
Generalized Jacobsthal sequence.
- Number of n-digit primes ending in 1 in base 10.A087630
Number of n-digit primes ending in 1 in base 10.
- Number of n-digit primes ending in 3 in base 10.A087631
Number of n-digit primes ending in 3 in base 10.
- Number of n-digit primes ending in 7 in base 10.A087632
Number of n-digit primes ending in 7 in base 10.
- Number of n-digit primes ending in 9 in base 10.A087633
Number of n-digit primes ending in 9 in base 10.
- Primes p such that the equation phi(x) = 4p has a solution, where phi is the totient function.A087634
Primes p such that the equation phi(x) = 4p has a solution, where phi is the totient function.
- a(n) = S(n,3) where S(n,m) = Sum_{k=0..n} binomial(n,k)*Fibonacci(m*k).A087635
a(n) = S(n,3) where S(n,m) = Sum_{k=0..n} binomial(n,k)*Fibonacci(m*k).
- Number of n-digit lunar primes.A087636
Number of n-digit lunar primes.
- Erroneous version of A052458.A087637
Erroneous version of A052458.
- Number of lunar primes with <= n digits.A087638
Number of lunar primes with <= n digits.
- E.g.f.: Product_{m >= 1} (1+x^(2*m)/(2*m)) (even powers only).A087639
E.g.f.: Product_{m >= 1} (1+x^(2*m)/(2*m)) (even powers only).
- To obtain a(n+1), take the square of the n-th partial sum, minus the sum of the first n squared terms, then divide this difference by a(n); for all n>1, starting with a(0)=1, a(1)=1.A087640
To obtain a(n+1), take the square of the n-th partial sum, minus the sum of the first n squared terms, then divide this difference by a(n); for all n>1, starting with a(0)=1, a(1)=1.
- Start of the first sequence of exactly n consecutive pairs of twin primes.A087641
Start of the first sequence of exactly n consecutive pairs of twin primes.
- Sequence of squarefree n such that Q(sqrt(n)) has no element with a fully periodical continued fraction of period 1.A087642
Sequence of squarefree n such that Q(sqrt(n)) has no element with a fully periodical continued fraction of period 1.
- Nonsquare positive integers n such that the fundamental unit of quadratic field Q(sqrt(n)) has norm 1.A087643
Nonsquare positive integers n such that the fundamental unit of quadratic field Q(sqrt(n)) has norm 1.
- Triangle T(n,k) (n >= 2, 1 <= k <= n) read by rows: (1/2) times number of linearly inducible orderings of n points in k-dimensional Euclidean space.A087644
Triangle T(n,k) (n >= 2, 1 <= k <= n) read by rows: (1/2) times number of linearly inducible orderings of n points in k-dimensional Euclidean space.
- Third column of A071223.A087645
Third column of A071223.
- a(n) is the first term of the first run of exactly n non-perfect-powers.A087646
a(n) is the first term of the first run of exactly n non-perfect-powers.
- Triangle of 3-Narayana numbers, N(n,k), for n >= 1, 0 <= k <= 2n-2.A087647
Triangle of 3-Narayana numbers, N(n,k), for n >= 1, 0 <= k <= 2n-2.
- a(n) = (1/2)*(Bell(n+2)+Bell(n+1)-Bell(n)).A087648
a(n) = (1/2)*(Bell(n+2)+Bell(n+1)-Bell(n)).
- a(n) = (1/2)*(Bell(n+2)-Bell(n+1)+Bell(n)).A087649
a(n) = (1/2)*(Bell(n+2)-Bell(n+1)+Bell(n)).
- a(n) = Sum_{k=0..n} (-1)^(n-k)*Bell(k).A087650
a(n) = Sum_{k=0..n} (-1)^(n-k)*Bell(k).
- Sequence of primorials P# (cf. A002110) such that j*P# has twin prime neighbors for some j with 0 < j < prime following P.A087651
Sequence of primorials P# (cf. A002110) such that j*P# has twin prime neighbors for some j with 0 < j < prime following P.
- Product of the nonprime divisors of n.A087652
Product of the nonprime divisors of n.
- Maximum difference between exponents in n-th cyclotomic polynomial.A087653
Maximum difference between exponents in n-th cyclotomic polynomial.
- Decimal expansion of D(1) where D(x) is the Dawson function.A087654
Decimal expansion of D(1) where D(x) is the Dawson function.
- a[n] = a[abs[n - a[n-1]]] + a[abs[n - a[n-2]]]+ a[abs[n - a[n-3]]].A087655
a[n] = a[abs[n - a[n-1]]] + a[abs[n - a[n-2]]]+ a[abs[n - a[n-3]]].
- Let f be defined on the rationals by f(p/q) =(p+1)/(q+1)=p_{1}/q_{1} where (p_{1},q_{1})=1. Let f^k(p/q)=p_{k}/q_{k} where (p_{k},q_{k})=1. Sequence gives least k such that p_{k}-q_{k} = 1 starting at n.A087656
Let f be defined on the rationals by f(p/q) =(p+1)/(q+1)=p_{1}/q_{1} where (p_{1},q_{1})=1. Let f^k(p/q)=p_{k}/q_{k} where (p_{k},q_{k})=1. Sequence gives least k such that p_{k}-q_{k} = 1 starting at n.
- a(n) = abs(prime(n)-a(n-1)) + abs(prime(n)-a(n-2)) + abs(prime(n)-a(n-3)).A087657
a(n) = abs(prime(n)-a(n-1)) + abs(prime(n)-a(n-2)) + abs(prime(n)-a(n-3)).
- Repeated terms in A087657 (a(n) = |prime(n)-a(n-1)| + |prime(n)-a(n-2)| + |prime(n)-a(n-3)| ).A087658
Repeated terms in A087657 (a(n) = |prime(n)-a(n-1)| + |prime(n)-a(n-2)| + |prime(n)-a(n-3)| ).
- a(n) = hypergeom([ -n, (n+4)/2, (n+5)/2], [3, 2], -4).A087659
a(n) = hypergeom([ -n, (n+4)/2, (n+5)/2], [3, 2], -4).
- Values of a certain hypergeometric function. Not known to be always integer-valued.A087660
Values of a certain hypergeometric function. Not known to be always integer-valued.