Sequences
392,541 sequences
- Denoting 5 consecutive primes by p, q, r, s and t, these are the values of q such that q, r and s have 10 as a primitive root, but p and t do not.A060261
Denoting 5 consecutive primes by p, q, r, s and t, these are the values of q such that q, r and s have 10 as a primitive root, but p and t do not.
- a(n) is the smallest k such that prime(k), prime(k+1), ..., prime(k+n-1) all have 10 as a primitive root, but prime(k-1) and prime(k+n) do not.A060262
a(n) is the smallest k such that prime(k), prime(k+1), ..., prime(k+n-1) all have 10 as a primitive root, but prime(k-1) and prime(k+n) do not.
- a(n) = smallest prime q such that precisely n successive primes p starting at q have reciprocals with period p-1 and prevprime(q) is not such a prime.A060263
a(n) = smallest prime q such that precisely n successive primes p starting at q have reciprocals with period p-1 and prevprime(q) is not such a prime.
- First prime after 2n.A060264
First prime after 2n.
- Largest prime less than 2n.A060265
Largest prime less than 2n.
- Difference between 2n and the following prime.A060266
Difference between 2n and the following prime.
- Difference between 2 closest primes surrounding 2n.A060267
Difference between 2 closest primes surrounding 2n.
- Distance of 2n from the closest prime.A060268
Distance of 2n from the closest prime.
- Distance of n-th primorial from closest prime.A060269
Distance of n-th primorial from closest prime.
- Distance of n-th primorial from previous prime.A060270
Distance of n-th primorial from previous prime.
- Difference between smallest prime following and largest prime preceding 2*(n-th prime).A060271
Difference between smallest prime following and largest prime preceding 2*(n-th prime).
- Distance from n^2 to closest prime.A060272
Distance from n^2 to closest prime.
- Hard numbers: a(n) = smallest positive number m with f(m) = n, where f(m) is the smallest number of digits that are needed to construct m using only 1's, 2's and any number of +, -, *, ^ signs, allowing concatenation of the digits.A060273
Hard numbers: a(n) = smallest positive number m with f(m) = n, where f(m) is the smallest number of digits that are needed to construct m using only 1's, 2's and any number of +, -, *, ^ signs, allowing concatenation of the digits.
- Hard numbers: a(n) = smallest positive number m with f(m) = n, where f(m) is the smallest number of digits that are needed to construct m using only 1's, 2's and any number of +, -, *, ^ signs, not allowing concatenation of the digits.A060274
Hard numbers: a(n) = smallest positive number m with f(m) = n, where f(m) is the smallest number of digits that are needed to construct m using only 1's, 2's and any number of +, -, *, ^ signs, not allowing concatenation of the digits.
- At least two ordered triples of positive numbers have sum n and equal products.A060275
At least two ordered triples of positive numbers have sum n and equal products.
- a(1) = 2; a(n) = smallest prime > a(n-1) such that the sum of any three nondecreasing terms, chosen from a(1), ..., a(n-1) and a(n), is unique.A060276
a(1) = 2; a(n) = smallest prime > a(n-1) such that the sum of any three nondecreasing terms, chosen from a(1), ..., a(n-1) and a(n), is unique.
- Number of m for which a+b+c = n; abc = m has at least two distinct solutions (a,b,c) with 1 <= a <= b <= c.A060277
Number of m for which a+b+c = n; abc = m has at least two distinct solutions (a,b,c) with 1 <= a <= b <= c.
- Sum of composite divisors of n less than n.A060278
Sum of composite divisors of n less than n.
- Number of labeled rooted trees with all 2n nodes of odd degree.A060279
Number of labeled rooted trees with all 2n nodes of odd degree.
- Number of orbits of length n under the map whose periodic points are counted by A001350.A060280
Number of orbits of length n under the map whose periodic points are counted by A001350.
- Triangle T(n,k) read by rows giving number of labeled mappings (or functional digraphs) from n points to themselves (endofunctions) with exactly k cycles, k=1..n.A060281
Triangle T(n,k) read by rows giving number of labeled mappings (or functional digraphs) from n points to themselves (endofunctions) with exactly k cycles, k=1..n.
- Periodic part of decimal expansion of reciprocal of n-th prime (leading 0's omitted).A060282
Periodic part of decimal expansion of reciprocal of n-th prime (leading 0's omitted).
- Periodic part of decimal expansion of reciprocal of n-th prime (leading 0's moved to end).A060283
Periodic part of decimal expansion of reciprocal of n-th prime (leading 0's moved to end).
- Periodic part of decimal expansion of 1/n (leading 0's omitted).A060284
Periodic part of decimal expansion of 1/n (leading 0's omitted).
- Number of partitions of n objects of 2 colors with parts size >1.A060285
Number of partitions of n objects of 2 colors with parts size >1.
- a(n) = 2^(p-1)*(2^p-1) where p is prime(n).A060286
a(n) = 2^(p-1)*(2^p-1) where p is prime(n).
- Triangle formed from coefficients in expansion of Product_{i=3..infinity, j=0..i} 1/(1-x^(i-j)*y^j).A060287
Triangle formed from coefficients in expansion of Product_{i=3..infinity, j=0..i} 1/(1-x^(i-j)*y^j).
- Distinct (non-overlapping) twin Harshad numbers whose sum is prime.A060288
Distinct (non-overlapping) twin Harshad numbers whose sum is prime.
- Number of distinct (non-overlapping) twin Harshad numbers whose sum is prime and where the 2nd Harshad is <= 10^n.A060289
Number of distinct (non-overlapping) twin Harshad numbers whose sum is prime and where the 2nd Harshad is <= 10^n.
- Primes which are sums of twin Harshad numbers (includes overlaps).A060290
Primes which are sums of twin Harshad numbers (includes overlaps).
- Number of twin Harshads, including overlaps, whose sum is prime and where the 2nd Harshad is <= 10^n.A060291
Number of twin Harshads, including overlaps, whose sum is prime and where the 2nd Harshad is <= 10^n.
- At least two unordered triples of positive numbers have product n and equal sums.A060292
At least two unordered triples of positive numbers have product n and equal sums.
- Expected coupon collection numbers rounded up; i.e., if aiming to collect a set of n coupons, the expected number of random coupons required to receive the full set.A060293
Expected coupon collection numbers rounded up; i.e., if aiming to collect a set of n coupons, the expected number of random coupons required to receive the full set.
- Decimal expansion of Buffon's constant 2/Pi.A060294
Decimal expansion of Buffon's constant 2/Pi.
- Decimal expansion of exp(Pi*sqrt(163)).A060295
Decimal expansion of exp(Pi*sqrt(163)).
- Number of regular convex polytopes in n-dimensional space, or -1 if the number is infinite.A060296
Number of regular convex polytopes in n-dimensional space, or -1 if the number is infinite.
- Periodic part of decimal expansion of n / next prime > n.A060297
Periodic part of decimal expansion of n / next prime > n.
- Number of powers x^y (x,y > 1) with n digits.A060298
Number of powers x^y (x,y > 1) with n digits.
- Triangle T(m,n), 1 <= n <= m, read by rows: row m lists the first m consecutive composite numbers that are not in previous rows.A060299
Triangle T(m,n), 1 <= n <= m, read by rows: row m lists the first m consecutive composite numbers that are not in previous rows.
- a(n) = (2*n*(n+1))^2.A060300
a(n) = (2*n*(n+1))^2.
- For n>3: a(n) is a multiple of three distinct earlier terms.A060301
For n>3: a(n) is a multiple of three distinct earlier terms.
- Decimal expansion of (Pi^4 + Pi^5)^(1/6).A060302
Decimal expansion of (Pi^4 + Pi^5)^(1/6).
- Number of primes below n^2 does not exceed n times the number of primes below n.A060303
Number of primes below n^2 does not exceed n times the number of primes below n.
- Number of primes below n^3 does not exceed n times the number of primes below n^2.A060304
Number of primes below n^3 does not exceed n times the number of primes below n^2.
- Pisano periods for primes: period of Fibonacci numbers mod prime(n).A060305
Pisano periods for primes: period of Fibonacci numbers mod prime(n).
- Records in A025441.A060306
Records in A025441.
- Number of degree-4n permutations without odd cycles and such that number of cycles of size 2k is even (or zero) for every k.A060307
Number of degree-4n permutations without odd cycles and such that number of cycles of size 2k is even (or zero) for every k.
- Largest prime <= 2n.A060308
Largest prime <= 2n.
- A001067 appears to count the periodic points for a certain map. If so, then this is the sequence of the numbers of orbits of length n.A060309
A001067 appears to count the periodic points for a certain map. If so, then this is the sequence of the numbers of orbits of length n.
- a(1)=1, a(2)=3; then append digits of a(n-1)*a(n).A060310
a(1)=1, a(2)=3; then append digits of a(n-1)*a(n).