Sequences
392,541 sequences
- a(n) = 3^n mod 2n.A082511
a(n) = 3^n mod 2n.
- a(n) = p is the smallest prime introducing a consecutive prime-difference pattern as follows: [2,2n,2], i.e., [p, p+2, p+2+2n, p+2+2n+2] are consecutive primes. Increasing middle prime gap in the immediate neighborhood of two small gaps(=2); a(n) = 0 if no such pattern exists.A082512
a(n) = p is the smallest prime introducing a consecutive prime-difference pattern as follows: [2,2n,2], i.e., [p, p+2, p+2+2n, p+2+2n+2] are consecutive primes. Increasing middle prime gap in the immediate neighborhood of two small gaps(=2); a(n) = 0 if no such pattern exists.
- a(n)=A000720(n)-A000005(n).A082513
a(n)=A000720(n)-A000005(n).
- a(n) = pi(n) + tau(n).A082514
a(n) = pi(n) + tau(n).
- a(n)=A000720(n)+A000010(n).A082515
a(n)=A000720(n)+A000010(n).
- Differences between consecutive Niven (or Harshad) numbers.A082516
Differences between consecutive Niven (or Harshad) numbers.
- Numbers n such that N(n+1) - N(n) sets a new record, where N(n) = A005349.A082517
Numbers n such that N(n+1) - N(n) sets a new record, where N(n) = A005349.
- Palindromic primes whose digital root equals their middle digits.A082518
Palindromic primes whose digital root equals their middle digits.
- Number of times that k^2 + (n-k)^2 is prime for 1 <= k <= n-1.A082519
Number of times that k^2 + (n-k)^2 is prime for 1 <= k <= n-1.
- Palindromic Sophie Germain primes: both p and 2p+1 are palindromic primes.A082520
Palindromic Sophie Germain primes: both p and 2p+1 are palindromic primes.
- Least palindromic prime with at least 2n+1 central 0's.A082521
Least palindromic prime with at least 2n+1 central 0's.
- Numbers of the form p^(2^k) with p prime and k>0.A082522
Numbers of the form p^(2^k) with p prime and k>0.
- Number of times k^2 + (n-k)^2 is a square for 1 <= k <= n-1.A082523
Number of times k^2 + (n-k)^2 is a square for 1 <= k <= n-1.
- a(1)=1, a(2)=2, then use the rule when a(n) is the end of a run, n appears a(n) times.A082524
a(1)=1, a(2)=2, then use the rule when a(n) is the end of a run, n appears a(n) times.
- Numerators of coefficients in (1+x)^(1+x) power series.A082525
Numerators of coefficients in (1+x)^(1+x) power series.
- Denominators of coefficients in (1+x)^(1+x) power series.A082526
Denominators of coefficients in (1+x)^(1+x) power series.
- Least k such that x(k)=0 where x(1)=n and x(k)=k^2*floor(x(k-1)/k^2).A082527
Least k such that x(k)=0 where x(1)=n and x(k)=k^2*floor(x(k-1)/k^2).
- Least k such that x(k)=0 where x(1)=n x(k)=k^3*floor(x(k-1)/k^3).A082528
Least k such that x(k)=0 where x(1)=n x(k)=k^3*floor(x(k-1)/k^3).
- Numbers m that divide binomial(m*(m+1), m+1)/m^2.A082529
Numbers m that divide binomial(m*(m+1), m+1)/m^2.
- a(1)=1, a(n)=5*a(n-1)+1 if a(n-1) is odd, a(n)=a(n-1)/2+1 otherwise.A082530
a(1)=1, a(n)=5*a(n-1)+1 if a(n-1) is odd, a(n)=a(n-1)/2+1 otherwise.
- (-1)^n * coefficient of x^n in 1/x-1/(1-eta(x)) power series.A082531
(-1)^n * coefficient of x^n in 1/x-1/(1-eta(x)) power series.
- a(n) = n^2 - 2*floor(n/sqrt(2))^2.A082532
a(n) = n^2 - 2*floor(n/sqrt(2))^2.
- Number of primes p such that p can be expressed as the sum of consecutive primes with largest prime in the sum = n-th prime.A082533
Number of primes p such that p can be expressed as the sum of consecutive primes with largest prime in the sum = n-th prime.
- Greatest prime p such that p can be expressed as the sum of consecutive primes with largest prime in the sum = n-th prime.A082534
Greatest prime p such that p can be expressed as the sum of consecutive primes with largest prime in the sum = n-th prime.
- Duplicate of A007326.A082535
Duplicate of A007326.
- a(1) = 1; for n > 1, a(n) = smallest number greater than a(n-1) such that a(n-1)*a(n)+1 is a cube.A082536
a(1) = 1; for n > 1, a(n) = smallest number greater than a(n-1) such that a(n-1)*a(n)+1 is a cube.
- Cubes arising in A082536.A082537
Cubes arising in A082536.
- Number of numbers k which give 1 after applying exactly n iterations of the 3k+1 algorithm (if a number is even, divide it by 2; if it is odd, multiply by 3 and add 1). This total includes numbers k which also give 1 for a smaller number of iterations (i.e., for this sequence we do not assume the algorithm halts when 1 is reached).A082538
Number of numbers k which give 1 after applying exactly n iterations of the 3k+1 algorithm (if a number is even, divide it by 2; if it is odd, multiply by 3 and add 1). This total includes numbers k which also give 1 for a smaller number of iterations (i.e., for this sequence we do not assume the algorithm halts when 1 is reached).
- Primes p such that there is no prime q, q < p with q+1 dividing p+1.A082539
Primes p such that there is no prime q, q < p with q+1 dividing p+1.
- Number of ordered quadruples (a,b,c,d) with gcd(a,b,c,d)=1 (1 <= {a,b,c,d} <= n).A082540
Number of ordered quadruples (a,b,c,d) with gcd(a,b,c,d)=1 (1 <= {a,b,c,d} <= n).
- a(n) = (7*3^n - 4*0^n)/3.A082541
a(n) = (7*3^n - 4*0^n)/3.
- a(n) = prime(n) + 2 - (prime(n) mod 4).A082542
a(n) = prime(n) + 2 - (prime(n) mod 4).
- Take a string of n x's and insert n-1 ^'s and n-1 pairs of parentheses in all possible ways. Sequence gives number of distinct integer values when x=sqrt(2).A082543
Take a string of n x's and insert n-1 ^'s and n-1 pairs of parentheses in all possible ways. Sequence gives number of distinct integer values when x=sqrt(2).
- Number of ordered quintuples (a,b,c,d,e) with gcd(a,b,c,d,e)=1 (1<= {a,b,c,d,e} <= n).A082544
Number of ordered quintuples (a,b,c,d,e) with gcd(a,b,c,d,e)=1 (1<= {a,b,c,d,e} <= n).
- a(n) = (2*n)! * Sum_{k=0..n} binomial(n,k)/(n+k)!.A082545
a(n) = (2*n)! * Sum_{k=0..n} binomial(n,k)/(n+k)!.
- Numbers occurring more than once in A082534.A082546
Numbers occurring more than once in A082534.
- Number of primes p such that p can be expressed as the sum of distinct primes with largest prime in the sum = n-th prime.A082547
Number of primes p such that p can be expressed as the sum of distinct primes with largest prime in the sum = n-th prime.
- a(n) is the number of values of k such that k can be expressed as the sum of distinct primes with largest prime in the sum equal to prime(n).A082548
a(n) is the number of values of k such that k can be expressed as the sum of distinct primes with largest prime in the sum equal to prime(n).
- Numbers k such that concatenation of first k primes, separated by zeros, is prime.A082549
Numbers k such that concatenation of first k primes, separated by zeros, is prime.
- Number of sets of distinct positive integers whose arithmetic mean is an integer, the largest integer of the set being n.A082550
Number of sets of distinct positive integers whose arithmetic mean is an integer, the largest integer of the set being n.
- Denote sigma(n)-n by s(n); a(n)=1 if s(n)>n, a(n)=0 if s(n)=n, a(n)=-1 if s(n)<n.A082551
Denote sigma(n)-n by s(n); a(n)=1 if s(n)>n, a(n)=0 if s(n)=n, a(n)=-1 if s(n)<n.
- Number of sets of distinct primes, the greatest of which is prime(n), whose arithmetic mean is an integer.A082552
Number of sets of distinct primes, the greatest of which is prime(n), whose arithmetic mean is an integer.
- Number of sets of distinct positive integers whose geometric mean is an integer, the largest integer of a set is n.A082553
Number of sets of distinct positive integers whose geometric mean is an integer, the largest integer of a set is n.
- Primes whose base-2 representation is a block of 1's, followed by a block of 0's, followed by a block of 1's.A082554
Primes whose base-2 representation is a block of 1's, followed by a block of 0's, followed by a block of 1's.
- Primes whose base-3 representation does not contain a 0.A082555
Primes whose base-3 representation does not contain a 0.
- Expansion of g.f. Product_{m>=1} 1/(1-x^m)^30.A082556
Expansion of g.f. Product_{m>=1} 1/(1-x^m)^30.
- G.f.: Product_{m>=1} 1/(1-x^m)^32.A082557
G.f.: Product_{m>=1} 1/(1-x^m)^32.
- Expansion of Product_{m>=1} 1/(1-x^m)^48.A082558
Expansion of Product_{m>=1} 1/(1-x^m)^48.
- G.f.: Product_{m>=1} 1/(1-x^m)^64.A082559
G.f.: Product_{m>=1} 1/(1-x^m)^64.
- a(1)=1, a(n)=2*a(n-1) if n is odd, or a(n)=a(n/2)+1 if n is even.A082560
a(1)=1, a(n)=2*a(n-1) if n is odd, or a(n)=a(n/2)+1 if n is even.