Sequences
392,541 sequences
- Next new gap between successive prime powers.A090811
Next new gap between successive prime powers.
- Integers from 0 to 16 in French alphabetical order, stopping at 16 because the next contains a hyphen.A090812
Integers from 0 to 16 in French alphabetical order, stopping at 16 because the next contains a hyphen.
- a(n)=3*(3^prime(n)-1)*B(2*prime(n)) where prime(n)=n-th prime and B(k) denotes the k-th Bernoulli number.A090813
a(n)=3*(3^prime(n)-1)*B(2*prime(n)) where prime(n)=n-th prime and B(k) denotes the k-th Bernoulli number.
- a(n)=3*(3^prime(n)-1)/denominator(B(2*prime(n))) where prime(n)=n-th prime and B(k) denotes the k-th Bernoulli number.A090814
a(n)=3*(3^prime(n)-1)/denominator(B(2*prime(n))) where prime(n)=n-th prime and B(k) denotes the k-th Bernoulli number.
- a(n)=denominator(B(2*prime(n))) where prime(n)=n-th prime and B(k) denotes the k-th Bernoulli number.A090815
a(n)=denominator(B(2*prime(n))) where prime(n)=n-th prime and B(k) denotes the k-th Bernoulli number.
- a(n) = (3*n+1)!/((2*n)! * n!).A090816
a(n) = (3*n+1)!/((2*n)! * n!).
- a(n)=numerator(B(2*prime(n))) where prime(n)=n-th prime and B(k) denotes the k-th Bernoulli number.A090817
a(n)=numerator(B(2*prime(n))) where prime(n)=n-th prime and B(k) denotes the k-th Bernoulli number.
- Nonprime numbers k such that 3*(3^k-1)*B(2*k) is an integer, where B(k) denotes the k-th Bernoulli number.A090818
Nonprime numbers k such that 3*(3^k-1)*B(2*k) is an integer, where B(k) denotes the k-th Bernoulli number.
- Primes p such that the p-th Fibonacci number is nonprime.A090819
Primes p such that the p-th Fibonacci number is nonprime.
- Composite n such that Fibonacci(n) == Legendre(n,5) (mod n).A090820
Composite n such that Fibonacci(n) == Legendre(n,5) (mod n).
- Numbers that are products of two consecutive nonprimes.A090821
Numbers that are products of two consecutive nonprimes.
- Gijswijt's sequence: a(1) = 1; for n>1, a(n) = largest integer k such that the word a(1)a(2)...a(n-1) is of the form xy^k for words x and y (where y has positive length), i.e., the maximal number of repeating blocks at the end of the sequence so far.A090822
Gijswijt's sequence: a(1) = 1; for n>1, a(n) = largest integer k such that the word a(1)a(2)...a(n-1) is of the form xy^k for words x and y (where y has positive length), i.e., the maximal number of repeating blocks at the end of the sequence so far.
- a(n) = (3/2)*(1/p)*(2*p+1)*(3^p+1)*B(2*p) where p = prime(n) and where B(k) denotes the k-th Bernoulli number.A090823
a(n) = (3/2)*(1/p)*(2*p+1)*(3^p+1)*B(2*p) where p = prime(n) and where B(k) denotes the k-th Bernoulli number.
- Triangle read by rows: T(n,k) = number of partitions of binomial(n,k) into parts greater than k and not greater than n, 0<=k<=n.A090824
Triangle read by rows: T(n,k) = number of partitions of binomial(n,k) into parts greater than k and not greater than n, 0<=k<=n.
- Nonprimes n such that (3/2)*(1/n)*(2*n+1)*(3^n+1)*B(2*n) is an integer, where B(k) denotes the k-th Bernoulli number.A090825
Nonprimes n such that (3/2)*(1/n)*(2*n+1)*(3^n+1)*B(2*n) is an integer, where B(k) denotes the k-th Bernoulli number.
- Convolution of Catalan and Fibonacci numbers.A090826
Convolution of Catalan and Fibonacci numbers.
- Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A089869/A089870.A090827
Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A089869/A089870.
- Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A085163/A085164.A090828
Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A085163/A085164.
- Maximum cycle size in range [A014137(n-1)..A014138(n-1)] of permutation A085163/A085164.A090829
Maximum cycle size in range [A014137(n-1)..A014138(n-1)] of permutation A085163/A085164.
- Least common multiple of all cycle sizes in range [A014137(n-1)..A014138(n-1)] of permutation A085163/A085164.A090830
Least common multiple of all cycle sizes in range [A014137(n-1)..A014138(n-1)] of permutation A085163/A085164.
- a(n) = prime(n)^1 + prime(n-1)^2 + prime(n-2)^3 + ... + prime(1)^n.A090831
a(n) = prime(n)^1 + prime(n-1)^2 + prime(n-2)^3 + ... + prime(1)^n.
- Numbers k such that p(k), p(k)+6, p(k)+12, p(k)+18 are consecutive primes, where p(k) denotes k-th prime.A090832
Numbers k such that p(k), p(k)+6, p(k)+12, p(k)+18 are consecutive primes, where p(k) denotes k-th prime.
- Numbers n such that 6n+5, 6n+11, 6n+17, 6n+23 are consecutive primes or 6n+1, 6n+7, 6n+13, 6n+19 are consecutive primes.A090833
Numbers n such that 6n+5, 6n+11, 6n+17, 6n+23 are consecutive primes or 6n+1, 6n+7, 6n+13, 6n+19 are consecutive primes.
- Primes p such that p, p+6, p+12, p+18 are consecutive primes and p=6*k+5 for some k.A090834
Primes p such that p, p+6, p+12, p+18 are consecutive primes and p=6*k+5 for some k.
- Numbers n such that if p=prime(n), then p, p+6, p+12, p+18 are consecutive primes with p=6*k+5 for some k, where prime(n) denotes n-th prime.A090835
Numbers n such that if p=prime(n), then p, p+6, p+12, p+18 are consecutive primes with p=6*k+5 for some k, where prime(n) denotes n-th prime.
- Numbers k such that 6*k+5, 6*k+11, 6*k+17, 6*k+23 are consecutive primes.A090836
Numbers k such that 6*k+5, 6*k+11, 6*k+17, 6*k+23 are consecutive primes.
- Primes p such that p, p+6, p+12, p+18 are consecutive primes and p = 6*k+1 for some k.A090837
Primes p such that p, p+6, p+12, p+18 are consecutive primes and p = 6*k+1 for some k.
- Numbers n such that p(n),p(n)+6,p(n)+12,p(n)+18 are consecutive primes and p(n)=6*k+1 for some k, where p(n) denotes n-th prime.A090838
Numbers n such that p(n),p(n)+6,p(n)+12,p(n)+18 are consecutive primes and p(n)=6*k+1 for some k, where p(n) denotes n-th prime.
- Numbers k such that 6*k+1, 6*k+7, 6*k+13, 6*k+19 are consecutive primes.A090839
Numbers k such that 6*k+1, 6*k+7, 6*k+13, 6*k+19 are consecutive primes.
- Smallest prime whose product of digits is 5^n.A090840
Smallest prime whose product of digits is 5^n.
- Smallest prime whose product of digits is 7^n.A090841
Smallest prime whose product of digits is 7^n.
- Square array of numbers read by antidiagonals where T(n,k) = ((k+3)*(k+2)^n-2)/(k+1).A090842
Square array of numbers read by antidiagonals where T(n,k) = ((k+3)*(k+2)^n-2)/(k+1).
- Number of nodes on a tree with degree 11 interior nodes and degree 1 boundary nodes.A090843
Number of nodes on a tree with degree 11 interior nodes and degree 1 boundary nodes.
- Square array of numbers read by antidiagonals with T(n,k)=((k+3)(k+1)^n-2*0^n)/(k+1).A090844
Square array of numbers read by antidiagonals with T(n,k)=((k+3)(k+1)^n-2*0^n)/(k+1).
- Let A denote the sequence; A is equal to the union of the self-convolutions A^2 and A^3, with terms in ascending order by size.A090845
Let A denote the sequence; A is equal to the union of the self-convolutions A^2 and A^3, with terms in ascending order by size.
- Positions of the terms of A090845^3 in A090845, where A090845 is equal to the union of the self-convolutions A090845^2 and A090845^3, in ascending order by size, starting with A090845(0)=1.A090846
Positions of the terms of A090845^3 in A090845, where A090845 is equal to the union of the self-convolutions A090845^2 and A090845^3, in ascending order by size, starting with A090845(0)=1.
- Let A denote the sequence; then A is equal to the union of the self-convolutions A^2 and A^4, with terms in ascending order by size, where a(0)=1.A090847
Let A denote the sequence; then A is equal to the union of the self-convolutions A^2 and A^4, with terms in ascending order by size, where a(0)=1.
- Positions of the terms of A090847^4 in A090847, where A090847 is equal to the union of the self-convolutions A090847^2 and A090847^4 when ordered by size.A090848
Positions of the terms of A090847^4 in A090847, where A090847 is equal to the union of the self-convolutions A090847^2 and A090847^4 when ordered by size.
- Smallest positive k such that phi(1+k*2^n) <= phi(k*2^n), where phi is Euler's totient function.A090849
Smallest positive k such that phi(1+k*2^n) <= phi(k*2^n), where phi is Euler's totient function.
- Clark's triangle with f=6 read by row.A090850
Clark's triangle with f=6 read by row.
- Smallest positive k such that phi(2n*k+1) < phi(2n*k), where phi is Euler's totient function.A090851
Smallest positive k such that phi(2n*k+1) < phi(2n*k), where phi is Euler's totient function.
- a(n) is the least positive integer such that the integer part of the arithmetic-geometric mean of a(n) and 1 is equal to n.A090852
a(n) is the least positive integer such that the integer part of the arithmetic-geometric mean of a(n) and 1 is equal to n.
- a(n) is the least positive integer such that the arithmetic-geometric mean satisfies: floor( agm(a(n),a(n-2)) ) = a(n-1) for n>2, with a(1)=1, a(2)=2.A090853
a(n) is the least positive integer such that the arithmetic-geometric mean satisfies: floor( agm(a(n),a(n-2)) ) = a(n-1) for n>2, with a(1)=1, a(2)=2.
- a(n) is the least positive integer such that the integer part of the arithmetic-geometric mean of a(n) and 1 is equal to Fibonacci(n).A090854
a(n) is the least positive integer such that the integer part of the arithmetic-geometric mean of a(n) and 1 is equal to Fibonacci(n).
- a(n) is the least positive integer such that the integer part of the arithmetic-geometric mean of a(n) and 1 is equal to 2^n.A090855
a(n) is the least positive integer such that the integer part of the arithmetic-geometric mean of a(n) and 1 is equal to 2^n.
- a(n) is the least positive integer such that the integer part of the arithmetic-geometric mean of a(n) and 1 is equal to 3^n.A090856
a(n) is the least positive integer such that the integer part of the arithmetic-geometric mean of a(n) and 1 is equal to 3^n.
- a(n) is the least positive integer such that the integer part of the arithmetic-geometric mean of a(n) and 2^n is equal to 3^n.A090857
a(n) is the least positive integer such that the integer part of the arithmetic-geometric mean of a(n) and 2^n is equal to 3^n.
- Number of partitions of n such that there is exactly one part which occurs twice, while all other parts occur only once.A090858
Number of partitions of n such that there is exactly one part which occurs twice, while all other parts occur only once.
- Sequence coincides with union of its first and 2nd binomial transforms, ordered by size, with a(0)=1.A090859
Sequence coincides with union of its first and 2nd binomial transforms, ordered by size, with a(0)=1.
- Number of ways of 4-coloring a map in which there is a central circle surrounded by an annulus divided into n-1 regions. There are n regions in all.A090860
Number of ways of 4-coloring a map in which there is a central circle surrounded by an annulus divided into n-1 regions. There are n regions in all.