Sequences
392,541 sequences
- a(n) = A088760(n+1)/A088760(n).A088761
a(n) = A088760(n+1)/A088760(n).
- Numbers n such that (2n-1, 2n+3) is a cousin prime pair.A088762
Numbers n such that (2n-1, 2n+3) is a cousin prime pair.
- a(n) = A087695(n)/2.A088763
a(n) = A087695(n)/2.
- a(n) = (A087680(n)-1)/2.A088764
a(n) = (A087680(n)-1)/2.
- a(n) = A087696(n)/2.A088765
a(n) = A087696(n)/2.
- a(n) = (A087681(n)-1)/2.A088766
a(n) = (A087681(n)-1)/2.
- a(n) = A087697(n)/2.A088767
a(n) = A087697(n)/2.
- a(n) = (A087682(n)-1)/2.A088768
a(n) = (A087682(n)-1)/2.
- a(n) = A087678(n)/2.A088769
a(n) = A087678(n)/2.
- a(n) = (A087683(n)-1)/2.A088770
a(n) = (A087683(n)-1)/2.
- a(n)=A082776(n+1)/A082776(n).A088771
a(n)=A082776(n+1)/A082776(n).
- a(n) = A082777(n+1)/A082777(n).A088772
a(n) = A082777(n+1)/A082777(n).
- a(n) = A082778(n+1)/A082778(n).A088773
a(n) = A082778(n+1)/A082778(n).
- a(n) = A082779(n+1)/A082779(n).A088774
a(n) = A082779(n+1)/A082779(n).
- a(n) = A082780(n+1)/A082780(n).A088775
a(n) = A082780(n+1)/A082780(n).
- a(n)=A082781(n+1)/A082781(n).A088776
a(n)=A082781(n+1)/A082781(n).
- a(n) = A082782(n+1)/A082782(n).A088777
a(n) = A082782(n+1)/A082782(n).
- a(n)=A082783(n+1)/A082783(n).A088778
a(n)=A082783(n+1)/A082783(n).
- a(n) = A088780(n+1)/A088780(n).A088779
a(n) = A088780(n+1)/A088780(n).
- a(1) = 9, a(n) = smallest palindromic multiple of a(n-1) obtained by inserting digits anywhere in a(n-1).A088780
a(1) = 9, a(n) = smallest palindromic multiple of a(n-1) obtained by inserting digits anywhere in a(n-1).
- A068164 indexed by A000040.A088781
A068164 indexed by A000040.
- a(n) is the smallest k>0 such that concatenation of n^k and 1 is prime, or 0 if no such number exists.A088782
a(n) is the smallest k>0 such that concatenation of n^k and 1 is prime, or 0 if no such number exists.
- Numbers n such that 10*n^k + 1 is composite for all k > 0.A088783
Numbers n such that 10*n^k + 1 is composite for all k > 0.
- Primes formed by concatenating a prime with the preceding prime.A088784
Primes formed by concatenating a prime with the preceding prime.
- Primes yielding other primes after each digit is incremented by 2 with carries ignored.A088785
Primes yielding other primes after each digit is incremented by 2 with carries ignored.
- Numbers n which are prime and which when each digit is incremented by 2 with carries ignored yields another prime p with the same property.A088786
Numbers n which are prime and which when each digit is incremented by 2 with carries ignored yields another prime p with the same property.
- Numbers which are primes and which remain prime for three successive applications of incrementing each digit by 2 with carries ignored.A088787
Numbers which are primes and which remain prime for three successive applications of incrementing each digit by 2 with carries ignored.
- Numbers that are primes and remain prime for four successive applications of incrementing each digit by 2 with carries ignored.A088788
Numbers that are primes and remain prime for four successive applications of incrementing each digit by 2 with carries ignored.
- E.g.f.: REVERT(2*x/(1+exp(x))) = Sum_{n>=0} a(n)*x^n/n!.A088789
E.g.f.: REVERT(2*x/(1+exp(x))) = Sum_{n>=0} a(n)*x^n/n!.
- Numbers k such that (k^k-1)/(k-1) is prime.A088790
Numbers k such that (k^k-1)/(k-1) is prime.
- Coefficient of x^n in A(x)^n is A000670(n), which gives preferential arrangements of n labeled elements.A088791
Coefficient of x^n in A(x)^n is A000670(n), which gives preferential arrangements of n labeled elements.
- Expansion of g.f. A(x) satisfying A(x)^2 = A(x*A(x)) / (1-x) with A(0) = 1.A088792
Expansion of g.f. A(x) satisfying A(x)^2 = A(x*A(x)) / (1-x) with A(0) = 1.
- G.f. satisfies: A(x)*(1-x) = 1 + x^2*A(x*A(x)).A088793
G.f. satisfies: A(x)*(1-x) = 1 + x^2*A(x*A(x)).
- Coefficient of x^n in A(x)^(2n) is A004123(n); self-convolution is A088222.A088794
Coefficient of x^n in A(x)^(2n) is A004123(n); self-convolution is A088222.
- a(n) = -1/16-3*n^2/8+17*n/12+n^3/12+(-1)^n/16.A088795
a(n) = -1/16-3*n^2/8+17*n/12+n^3/12+(-1)^n/16.
- Primes p such that p^3 + p^2 - 1 is also prime.A088796
Primes p such that p^3 + p^2 - 1 is also prime.
- Numbers n > 2 such that n divides the concatenation of n-2 and n-1.A088797
Numbers n > 2 such that n divides the concatenation of n-2 and n-1.
- Numbers n that divide the concatenation of n-1, n-2 and n-3.A088798
Numbers n that divide the concatenation of n-1, n-2 and n-3.
- Numbers n which are divisors of the number formed by concatenating (n-3), (n-2) and (n-1) in that order.A088799
Numbers n which are divisors of the number formed by concatenating (n-3), (n-2) and (n-1) in that order.
- Numbers n which are divisors of the number formed by concatenating (n-1), (n-2), (n-3) and (n-4) in that order.A088800
Numbers n which are divisors of the number formed by concatenating (n-1), (n-2), (n-3) and (n-4) in that order.
- Numerators of coefficients of powers of n^(-1) in the Romanovsky series expansion of the mean of the standard deviation from a normal population.A088801
Numerators of coefficients of powers of n^(-1) in the Romanovsky series expansion of the mean of the standard deviation from a normal population.
- Denominators of the coefficients of powers of n^(-1) in the Romanovsky series expansion of the mean of the standard deviation from a normal population.A088802
Denominators of the coefficients of powers of n^(-1) in the Romanovsky series expansion of the mean of the standard deviation from a normal population.
- a(n) gives the number of steps taken in a process which manipulates piles of tokens arranged in a line. There are 2n (or 2n+1) tokens in all. Initially they are all in one pile. At each step every pile with more than 1 token is divided into two and half the token are added to the pile on the left and half to the pile on the right. If a pile has an odd number of tokens, the token left over stays where it is. The redistributions in each step are done in parallel.A088803
a(n) gives the number of steps taken in a process which manipulates piles of tokens arranged in a line. There are 2n (or 2n+1) tokens in all. Initially they are all in one pile. At each step every pile with more than 1 token is divided into two and half the token are added to the pile on the left and half to the pile on the right. If a pile has an odd number of tokens, the token left over stays where it is. The redistributions in each step are done in parallel.
- a(n) gives the number of steps taken in a process which manipulates piles of tokens arranged in a line. There are 2n (or 2n+1) tokens in all. Initially they are all in one pile. At each step, from each pile with more than 1 token, one token is taken and added to the pile on its left and one is taken and added to the pile on its right. The redistributions in each step are done in parallel.A088804
a(n) gives the number of steps taken in a process which manipulates piles of tokens arranged in a line. There are 2n (or 2n+1) tokens in all. Initially they are all in one pile. At each step, from each pile with more than 1 token, one token is taken and added to the pile on its left and one is taken and added to the pile on its right. The redistributions in each step are done in parallel.
- 10^p + p for prime p.A088805
10^p + p for prime p.
- Number of non-Abelian nilpotent groups of order n.A088806
Number of non-Abelian nilpotent groups of order n.
- Number of distinct prime factors of p^p - 1 where p = prime(n).A088807
Number of distinct prime factors of p^p - 1 where p = prime(n).
- Number of subsets of {1, ..., n} that are not double-free.A088808
Number of subsets of {1, ..., n} that are not double-free.
- Number of subsets of {1, ..., n} that are not sum-free.A088809
Number of subsets of {1, ..., n} that are not sum-free.
- Number of subsets of {1, ..., n} that are double-free but not sum-free.A088810
Number of subsets of {1, ..., n} that are double-free but not sum-free.