Sequences
392,541 sequences
- Partial sums of A093660.A093661
Partial sums of A093660.
- Lower triangular matrix, read by rows, defined as the convergent of the concatenation of matrices using the iteration: M(n+1) = [[M(n),0*M(n)],[M(n),M(n)^2]], with M(0) = [1].A093662
Lower triangular matrix, read by rows, defined as the convergent of the concatenation of matrices using the iteration: M(n+1) = [[M(n),0*M(n)],[M(n),M(n)^2]], with M(0) = [1].
- Row sums of lower triangular matrix A093662.A093663
Row sums of lower triangular matrix A093662.
- Convergent of 2^n-th row of lower triangular matrix A093662.A093664
Convergent of 2^n-th row of lower triangular matrix A093662.
- Numbers k that divide 2^(k^3) + 1.A093665
Numbers k that divide 2^(k^3) + 1.
- Numbers n such that n | 3^n^2 + 1.A093666
Numbers n such that n | 3^n^2 + 1.
- a(n) = prime(n) - prime(n+1) + prime(n+2).A093667
a(n) = prime(n) - prime(n+1) + prime(n+2).
- Duplicate of A000926.A093668
Duplicate of A000926.
- Numbers having a unique representation as ab+ac+bc, with 0 < a < b < c.A093669
Numbers having a unique representation as ab+ac+bc, with 0 < a < b < c.
- Numbers having a unique representation as ab+ac+bc, with 1 <= a <= b <= c.A093670
Numbers having a unique representation as ab+ac+bc, with 1 <= a <= b <= c.
- Primes of the form 10^k + 3*R_k, where R_k is the repunit (A002275) of length k.A093671
Primes of the form 10^k + 3*R_k, where R_k is the repunit (A002275) of length k.
- Primes of the form (7*10^k - 1)/3.A093672
Primes of the form (7*10^k - 1)/3.
- Primes of the form 4*10^k + 3*R_k, where R_k is the repunit (A002275) of length k.A093673
Primes of the form 4*10^k + 3*R_k, where R_k is the repunit (A002275) of length k.
- Primes of the form 5*10^k + 3*R_k, where R_k is the repunit (A002275) of length k.A093674
Primes of the form 5*10^k + 3*R_k, where R_k is the repunit (A002275) of length k.
- Primes of the form 7*10^k + 3*R_k, where R_k is the repunit (A002275) of length k.A093675
Primes of the form 7*10^k + 3*R_k, where R_k is the repunit (A002275) of length k.
- Primes of the form 8*10^k + 3*R_k, where R_k is the repunit (A002275) of length k.A093676
Primes of the form 8*10^k + 3*R_k, where R_k is the repunit (A002275) of length k.
- Self-convolution of A093659, which is the first column of triangle A093658.A093677
Self-convolution of A093659, which is the first column of triangle A093658.
- Sequence contains no 3-term arithmetic progression, starting with 1, 7.A093678
Sequence contains no 3-term arithmetic progression, starting with 1, 7.
- Sequence contains no 3-term arithmetic progression, starting with 1, 10.A093679
Sequence contains no 3-term arithmetic progression, starting with 1, 10.
- Sequence contains no 3-term arithmetic progression, starting with 1, 19.A093680
Sequence contains no 3-term arithmetic progression, starting with 1, 19.
- Sequence contains no 3-term arithmetic progression, starting with 1, 28.A093681
Sequence contains no 3-term arithmetic progression, starting with 1, 28.
- Array T(m,n) by antidiagonals: nonarithmetic-3-progression sequences with simple closed forms.A093682
Array T(m,n) by antidiagonals: nonarithmetic-3-progression sequences with simple closed forms.
- Number of pairs of twin primes <= 10^n-th prime.A093683
Number of pairs of twin primes <= 10^n-th prime.
- In binary representation: number of occurrences of n in n!.A093684
In binary representation: number of occurrences of n in n!.
- In binary representation: numbers not occurring in their factorial.A093685
In binary representation: numbers not occurring in their factorial.
- In binary representation: numbers occurring at least once in their factorial.A093686
In binary representation: numbers occurring at least once in their factorial.
- Numbers k such that the total number of 1's in the binary expansion of all the divisors of k sets a new record.A093687
Numbers k such that the total number of 1's in the binary expansion of all the divisors of k sets a new record.
- Numbers m such that all divisors of m, excluding the divisor 1, have an even number of 1's in their binary expansions.A093688
Numbers m such that all divisors of m, excluding the divisor 1, have an even number of 1's in their binary expansions.
- Least k such that prime(n) divides A007406(k), the numerator of the k-th generalized harmonic number H(k,2) = Sum_{i=1..k} 1/i^2.A093689
Least k such that prime(n) divides A007406(k), the numerator of the k-th generalized harmonic number H(k,2) = Sum_{i=1..k} 1/i^2.
- Primes p that divide A007406(k), the numerator of the k-th generalized harmonic number H(k,2) = Sum 1/i^2 for i=1..k, for some k < (p-1)/2.A093690
Primes p that divide A007406(k), the numerator of the k-th generalized harmonic number H(k,2) = Sum 1/i^2 for i=1..k, for some k < (p-1)/2.
- a(n) is chosen so as to maximize the number of different substrings in (a(1),a(2),...,a(n)).A093691
a(n) is chosen so as to maximize the number of different substrings in (a(1),a(2),...,a(n)).
- a(n) is chosen so as to maximize the number of different substrings in (a(1),a(2),...,a(n)) (in base 2).A093692
a(n) is chosen so as to maximize the number of different substrings in (a(1),a(2),...,a(n)) (in base 2).
- a(n) is chosen so as to maximize the number of different substrings in (a(1),a(2),...,a(n)) (in base 3).A093693
a(n) is chosen so as to maximize the number of different substrings in (a(1),a(2),...,a(n)) (in base 3).
- Number of one-element transitions from the partitions of n to the partitions of n+1 for labeled parts.A093694
Number of one-element transitions from the partitions of n to the partitions of n+1 for labeled parts.
- Number of one-element transitions among partitions of the integer n for unlabeled parts.A093695
Number of one-element transitions among partitions of the integer n for unlabeled parts.
- Numbers n such that all divisors of n have an odd number of 1's in their binary expansions.A093696
Numbers n such that all divisors of n have an odd number of 1's in their binary expansions.
- Least k so that n! >= primorial(k).A093697
Least k so that n! >= primorial(k).
- a(n) = floor( e^((n/2)*arccosh(1+sqrt(2))) ).A093698
a(n) = floor( e^((n/2)*arccosh(1+sqrt(2))) ).
- Maximum number of odd 2 X 2 submatrices over all 2n X 2n (0,1) matrices.A093699
Maximum number of odd 2 X 2 submatrices over all 2n X 2n (0,1) matrices.
- Number of 9's immediately following the decimal point in the expansion of (3+sqrt(8))^n.A093700
Number of 9's immediately following the decimal point in the expansion of (3+sqrt(8))^n.
- a(n) = smallest m>a(n-1) such that 1+m*n is prime, a(1) = 1.A093701
a(n) = smallest m>a(n-1) such that 1+m*n is prime, a(1) = 1.
- a(n) = smallest prime p>a(n-1) such that n divides (p-1) and (p-1)/n > (a(n-1)-1)/(n-1), a(1) = 2.A093702
a(n) = smallest prime p>a(n-1) such that n divides (p-1) and (p-1)/n > (a(n-1)-1)/(n-1), a(1) = 2.
- Numbers whose Roman numeral representation, reversed, is a Roman numeral.A093703
Numbers whose Roman numeral representation, reversed, is a Roman numeral.
- Value of initial digit of n in Roman numeral representation.A093704
Value of initial digit of n in Roman numeral representation.
- Numbers that are divisible by the total number of 1's in the binary expansions of all their divisors.A093705
Numbers that are divisible by the total number of 1's in the binary expansions of all their divisors.
- Primes p such that (pp'-1)/2 is prime, where p' denotes the next prime after p.A093706
Primes p such that (pp'-1)/2 is prime, where p' denotes the next prime after p.
- Numbers n such that n^3 + (n-1)^2 is a prime.A093707
Numbers n such that n^3 + (n-1)^2 is a prime.
- Number of odd nonprime differences of 2 (twin odd nonprimes) below 10^n.A093708
Number of odd nonprime differences of 2 (twin odd nonprimes) below 10^n.
- Characteristic function of squares or twice squares.A093709
Characteristic function of squares or twice squares.
- Numbers k such that in their binary representation all numbers from 1 to k are contained in k!.A093710
Numbers k such that in their binary representation all numbers from 1 to k are contained in k!.