Sequences
392,541 sequences
- Least number m such that 2m can be expressed as the sum of two distinct primes in exactly n ways.A072511
Least number m such that 2m can be expressed as the sum of two distinct primes in exactly n ways.
- Product of all n - d, where 1 < d < n and d is a divisor of n.A072512
Product of all n - d, where 1 < d < n and d is a divisor of n.
- Product of all n - d, where d < n and d is a divisor of n.A072513
Product of all n - d, where d < n and d is a divisor of n.
- Sum of n mod k for k in {1...n} with gcd(k,n) > 1.A072514
Sum of n mod k for k in {1...n} with gcd(k,n) > 1.
- Let u(1) = u(2) = v(1) = v(2) = 1, u(n+2) = u(n)+v(n+1), v(n+2) = abs(u(n)-v(n+1)), then a(n) = u(n).A072515
Let u(1) = u(2) = v(1) = v(2) = 1, u(n+2) = u(n)+v(n+1), v(n+2) = abs(u(n)-v(n+1)), then a(n) = u(n).
- Sum of remainders when n is divided by lesser squares.A072516
Sum of remainders when n is divided by lesser squares.
- Smallest triangular number beginning with the n-th triangular number other than itself.A072517
Smallest triangular number beginning with the n-th triangular number other than itself.
- Index of smallest triangular number beginning with the n-th triangular number other than itself.A072518
Index of smallest triangular number beginning with the n-th triangular number other than itself.
- Smallest Fibonacci number beginning with the n-th Fibonacci number other than itself.A072519
Smallest Fibonacci number beginning with the n-th Fibonacci number other than itself.
- Index of smallest Fibonacci number beginning with the n-th Fibonacci number other than itself.A072520
Index of smallest Fibonacci number beginning with the n-th Fibonacci number other than itself.
- a(1) = 6 and then the smallest triangular numbers, larger than the previous term, such that sum of two neighbors is also a triangular number.A072521
a(1) = 6 and then the smallest triangular numbers, larger than the previous term, such that sum of two neighbors is also a triangular number.
- Smallest number a(n)>a(n-1) such that T(a(n-1))+T(a(n))=T(m) for some m, a(1)=3; T(i) are the triangular numbers.A072522
Smallest number a(n)>a(n-1) such that T(a(n-1))+T(a(n))=T(m) for some m, a(1)=3; T(i) are the triangular numbers.
- Sum of remainders when n-th Fibonacci number is divided by all smaller Fibonacci numbers > 1.A072523
Sum of remainders when n-th Fibonacci number is divided by all smaller Fibonacci numbers > 1.
- Sum of the remainders when the n-th triangular number is divided by all smaller triangular numbers > 1.A072524
Sum of the remainders when the n-th triangular number is divided by all smaller triangular numbers > 1.
- a(0) = 1; a(n+1) is smallest composite number > a(n) such that a(n) + a(n+1) is prime.A072525
a(0) = 1; a(n+1) is smallest composite number > a(n) such that a(n) + a(n+1) is prime.
- Numerator of number J(n) arising in computation of second moment of A*_n lattice.A072526
Numerator of number J(n) arising in computation of second moment of A*_n lattice.
- Number of values of k such that n divided by k leaves a remainder 3.A072527
Number of values of k such that n divided by k leaves a remainder 3.
- Table T(n,k) read by rows, giving number of occurrences of the remainder k when n is divided by i=1,2,3,...,n.A072528
Table T(n,k) read by rows, giving number of occurrences of the remainder k when n is divided by i=1,2,3,...,n.
- Product of the next n multiples of n.A072529
Product of the next n multiples of n.
- Number of primes p < n such that n divided by p leaves a prime remainder.A072530
Number of primes p < n such that n divided by p leaves a prime remainder.
- Number of primes p < n such that n divided by p leaves a 1 or a composite (nonzero) remainder.A072531
Number of primes p < n such that n divided by p leaves a 1 or a composite (nonzero) remainder.
- a(0)=1; for n>0, a(n) = smallest prime of the form k*a(n-1)-1 with k>1.A072532
a(0)=1; for n>0, a(n) = smallest prime of the form k*a(n-1)-1 with k>1.
- Least Keith number (or repfigit) with n digits, or 0 if there is none.A072533
Least Keith number (or repfigit) with n digits, or 0 if there is none.
- a(1) = 2, a(2) = 3 and a(n) = the smallest prime of the form k*a(n-1) - a(n-2).A072534
a(1) = 2, a(2) = 3 and a(n) = the smallest prime of the form k*a(n-1) - a(n-2).
- a(1) = 2, a(2) = 3 and a(n) = the smallest prime which is a linear combination of a(n-1) and a(n-2) of the form r*a(n-1) + s*a(n-2) with r,s >=1.A072535
a(1) = 2, a(2) = 3 and a(n) = the smallest prime which is a linear combination of a(n-1) and a(n-2) of the form r*a(n-1) + s*a(n-2) with r,s >=1.
- a(1) = 2, a(2) = 3, a(3) = 5 and a(n) = the smallest prime which is a linear combination of previous three terms with all coefficients >=1.A072536
a(1) = 2, a(2) = 3, a(3) = 5 and a(n) = the smallest prime which is a linear combination of previous three terms with all coefficients >=1.
- a(1) = 2, a(2) = 3 and a(n) = the smallest prime which is a linear combination of all previous terms with all coefficients >= 1.A072537
a(1) = 2, a(2) = 3 and a(n) = the smallest prime which is a linear combination of all previous terms with all coefficients >= 1.
- Erroneous version of A000040 (the primes).A072538
Erroneous version of A000040 (the primes).
- Duplicate of A062391.A072539
Duplicate of A062391.
- Numbers that are not differences between successive Ulam numbers (A002858).A072540
Numbers that are not differences between successive Ulam numbers (A002858).
- List of pairs of numbers (k, k+4), where k-1 and k+3 are primes.A072541
List of pairs of numbers (k, k+4), where k-1 and k+3 are primes.
- a(n) = the least positive integer k such that sigma(k) > sigma(1) + ... + sigma(n).A072542
a(n) = the least positive integer k such that sigma(k) > sigma(1) + ... + sigma(n).
- Numbers whose largest decimal digit is also the initial digit.A072543
Numbers whose largest decimal digit is also the initial digit.
- Numbers whose smallest decimal digit is also the initial digit.A072544
Numbers whose smallest decimal digit is also the initial digit.
- a(0) = 1, a(n) for n > 0 is the smallest number > a(n-1) such that a(n)-a(k) is nonprime for 0 <= k < n.A072545
a(0) = 1, a(n) for n > 0 is the smallest number > a(n-1) such that a(n)-a(k) is nonprime for 0 <= k < n.
- Sequence related to Fibonacci and "tribonacci" sequences : let f(1)=1, f(2)=n, f(k+2)=f(k+1)+f(k), t(1)=t(2)=t(3)=1, t(k+3)=t(k+2)+t(k+1)+t(k) (t(k)=A000213(k-1)); sequence gives the smallest value k = a(n) such that t(k)>f(k).A072546
Sequence related to Fibonacci and "tribonacci" sequences : let f(1)=1, f(2)=n, f(k+2)=f(k+1)+f(k), t(1)=t(2)=t(3)=1, t(k+3)=t(k+2)+t(k+1)+t(k) (t(k)=A000213(k-1)); sequence gives the smallest value k = a(n) such that t(k)>f(k).
- Main diagonal of the array in which first column and row are filled alternatively with 1's or 0's and then T(i,j) = T(i-1,j) + T(i,j-1).A072547
Main diagonal of the array in which first column and row are filled alternatively with 1's or 0's and then T(i,j) = T(i-1,j) + T(i,j-1).
- a(n) = sigma(n) mod PrimePi(n).A072548
a(n) = sigma(n) mod PrimePi(n).
- a(n) = abs(floor(n + a(n-1)^2/n - n*log(n))) with a(0)=1.A072549
a(n) = abs(floor(n + a(n-1)^2/n - n*log(n))) with a(0)=1.
- Number of Vice Presidents under n-th President of U.S.A.A072550
Number of Vice Presidents under n-th President of U.S.A.
- Decimal expansion of sqrt(e^(1/e)) = 1.20194336847031...A072551
Decimal expansion of sqrt(e^(1/e)) = 1.20194336847031...
- Number of connected planar regular graphs of degree 4 with n nodes.A072552
Number of connected planar regular graphs of degree 4 with n nodes.
- Sigma of n-th composite number equals a(n)-th composite number if it is also a composite or equals zero if sigma[c] is prime.A072553
Sigma of n-th composite number equals a(n)-th composite number if it is also a composite or equals zero if sigma[c] is prime.
- E24 range of preferred resistor values in electronic engineering.A072554
E24 range of preferred resistor values in electronic engineering.
- Smallest of four consecutive integers divisible by four consecutive primes respectively.A072555
Smallest of four consecutive integers divisible by four consecutive primes respectively.
- Numbers n such that n and the n-th Fibonacci number have the same number of distinct prime factors.A072556
Numbers n such that n and the n-th Fibonacci number have the same number of distinct prime factors.
- Let w(n) be defined by the following recurrence: w(1)=w(2)=w(3)=1, w(n)=(w(n-1)*w(n-2)+(w(n-1)+w(n-2))/3) / w(n-3); sequence gives values of n such that w(n) is an integer.A072557
Let w(n) be defined by the following recurrence: w(1)=w(2)=w(3)=1, w(n)=(w(n-1)*w(n-2)+(w(n-1)+w(n-2))/3) / w(n-3); sequence gives values of n such that w(n) is an integer.
- Decimal expansion of the one-ninth constant.A072558
Decimal expansion of the one-ninth constant.
- Continued fraction expansion of the One-ninth constant (A072558).A072559
Continued fraction expansion of the One-ninth constant (A072558).
- Denominators of w(n) where w(1)=w(2)=w(3)=1, w(n)=(w(n-1)*w(n-2)+(w(n-1)+w(n-2))/3) / w(n-3).A072560
Denominators of w(n) where w(1)=w(2)=w(3)=1, w(n)=(w(n-1)*w(n-2)+(w(n-1)+w(n-2))/3) / w(n-3).