Sequences
392,541 sequences
- Abundant numbers (A005101) with no subset of their divisors such that the complement has the same sum.A083211
Abundant numbers (A005101) with no subset of their divisors such that the complement has the same sum.
- Where records occur in A083206.A083212
Where records occur in A083206.
- Record values in A083206.A083213
Record values in A083206.
- Numbers k for which 3 | p(k), where p(k) = A000041(k) is the k-th partition number.A083214
Numbers k for which 3 | p(k), where p(k) = A000041(k) is the k-th partition number.
- a(n) = 1 + Sum(prime(i)*(2*i-1): 1<=i<=n).A083215
a(n) = 1 + Sum(prime(i)*(2*i-1): 1<=i<=n).
- Fibonacci-like sequence of composite numbers with a(0) = 20615674205555510, a(1) = 3794765361567513.A083216
Fibonacci-like sequence of composite numbers with a(0) = 20615674205555510, a(1) = 3794765361567513.
- a(n) = (2*5^n + (-1)^n)/3.A083217
a(n) = (2*5^n + (-1)^n)/3.
- a(n) = n mod (spf(n+1)+1), where spf(n) is the smallest prime factor of n (A020639).A083218
a(n) = n mod (spf(n+1)+1), where spf(n) is the smallest prime factor of n (A020639).
- a(n) = n - 2*floor(n/4).A083219
a(n) = n - 2*floor(n/4).
- a(n) = n + (n mod 4).A083220
a(n) = n + (n mod 4).
- Sieve of Eratosthenes arranged as an array and read by antidiagonals as A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), ...A083221
Sieve of Eratosthenes arranged as an array and read by antidiagonals as A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), ...
- a(n) = (4*5^n + (-5)^n)/5.A083222
a(n) = (4*5^n + (-5)^n)/5.
- a(n) = (5*6^n+(-6)^n)/6.A083223
a(n) = (5*6^n+(-6)^n)/6.
- a(n) = (6*7^n + (-7)^n)/7.A083224
a(n) = (6*7^n + (-7)^n)/7.
- a(n) = (7*8^n + (-8)^n)/8.A083225
a(n) = (7*8^n + (-8)^n)/8.
- a(n) = (8*9^n + (-9)^n)/9.A083226
a(n) = (8*9^n + (-9)^n)/9.
- a(n) = (9*10^n + (-10)^n)/10.A083227
a(n) = (9*10^n + (-10)^n)/10.
- A Jacobsthal related sequence.A083228
A Jacobsthal related sequence.
- a(n) = (3*3^n + (-5)^n)/4.A083229
a(n) = (3*3^n + (-5)^n)/4.
- Number of repunit divisors of n.A083230
Number of repunit divisors of n.
- a(n) = (3*5^n + (-3)^n)/4.A083231
a(n) = (3*5^n + (-3)^n)/4.
- a(n) = (3*7^n+(-1)^n)/4.A083232
a(n) = (3*7^n+(-1)^n)/4.
- a(n) = (3*8^n + 0^n)/4.A083233
a(n) = (3*8^n + 0^n)/4.
- a(n) = (3*10^n + 2^n)/4.A083234
a(n) = (3*10^n + 2^n)/4.
- First differences of A063742, the possible values for cototients.A083235
First differences of A063742, the possible values for cototients.
- First order recursion: a(0)=2; a(n) = prime(n) - a(n-1).A083236
First order recursion: a(0)=2; a(n) = prime(n) - a(n-1).
- First order recursion: a(0)=5; a(n)=prime(n)-a(n-1).A083237
First order recursion: a(0)=5; a(n)=prime(n)-a(n-1).
- First order recursion: a(0)=1; a(n) = sigma(1,n) - a(n-1).A083238
First order recursion: a(0)=1; a(n) = sigma(1,n) - a(n-1).
- First order recursion: a(0) = 1; a(n) = phi(n) - a(n-1) = A000010(n) - a(n-1).A083239
First order recursion: a(0) = 1; a(n) = phi(n) - a(n-1) = A000010(n) - a(n-1).
- Primes prime(j) such that prime(j)-j is a true power of prime.A083240
Primes prime(j) such that prime(j)-j is a true power of prime.
- a(n) + a(n-1) + a(n-2) + a(n-3) = prime(n), n>2, a(0)=a(1)=a(2)=0;.A083241
a(n) + a(n-1) + a(n-2) + a(n-3) = prime(n), n>2, a(0)=a(1)=a(2)=0;.
- For n >= 3, a(n-3) + a(n-2) + a(n-1) + a(n) = prime(n); a(0) = 0, a(1) = 1, a(2) = 1.A083242
For n >= 3, a(n-3) + a(n-2) + a(n-1) + a(n) = prime(n); a(0) = 0, a(1) = 1, a(2) = 1.
- Numbers k for which there are more divisors and coprimes than other numbers less than k: A045763(k) < A073757(k) or A045763(k) < k/2 or A073757(k) > k/2.A083243
Numbers k for which there are more divisors and coprimes than other numbers less than k: A045763(k) < A073757(k) or A045763(k) < k/2 or A073757(k) > k/2.
- k is in the sequence iff the number of numbers unrelated to k is larger than that of related ones[=divisors and coprimes] to k: A045763(k) > A073757(k) or A045763(k) > k/2 or A073757(k) < k/2.A083244
k is in the sequence iff the number of numbers unrelated to k is larger than that of related ones[=divisors and coprimes] to k: A045763(k) > A073757(k) or A045763(k) > k/2 or A073757(k) < k/2.
- Difference between numbers of related and numbers of unrelated numbers belonging to n: a(n) = A073757(n)-A045763(n) = (n-u(n))-u(n) = n-2*A045763(n) = 2*A073757(n)-n.A083245
Difference between numbers of related and numbers of unrelated numbers belonging to n: a(n) = A073757(n)-A045763(n) = (n-u(n))-u(n) = n-2*A045763(n) = 2*A073757(n)-n.
- Numbers n such that at least one of the following four conditions is satisfied: 1# d(n)=phi(n); 2# d(n)=u(n); 3# phi(n)=u(n), or 4# n=2u(n). Here d(n)=A000005(n) is the number of divisors of n, phi(n)=A000010(n) is Euler's totient and u(n)=A045763(n) is the size of the 'unrelated set'.A083246
Numbers n such that at least one of the following four conditions is satisfied: 1# d(n)=phi(n); 2# d(n)=u(n); 3# phi(n)=u(n), or 4# n=2u(n). Here d(n)=A000005(n) is the number of divisors of n, phi(n)=A000010(n) is Euler's totient and u(n)=A045763(n) is the size of the 'unrelated set'.
- Numbers k such that A000010(k) > A045763(k) > A000005(k).A083247
Numbers k such that A000010(k) > A045763(k) > A000005(k).
- Numbers k such that A045763(k) > A000010(k) > A000005(k).A083248
Numbers k such that A045763(k) > A000010(k) > A000005(k).
- Numbers k with A045763(k) = k + 1 - d(k) - phi(k) < d(k) < phi(k).A083249
Numbers k with A045763(k) = k + 1 - d(k) - phi(k) < d(k) < phi(k).
- Numbers m for which abs(A045763(m) - A073757(m)) = 3, i.e., signed difference of size of related and unrelated sets to n equals either 3 or -3.A083250
Numbers m for which abs(A045763(m) - A073757(m)) = 3, i.e., signed difference of size of related and unrelated sets to n equals either 3 or -3.
- Numbers m such that abs(A045763(m) - A073757(m)) = 2, i.e., signed difference of size of related and unrelated sets to n equals either 2 or -2.A083251
Numbers m such that abs(A045763(m) - A073757(m)) = 2, i.e., signed difference of size of related and unrelated sets to n equals either 2 or -2.
- Numbers k for which abs(A045763(k) - A073757(k)) = 5, i.e., signed difference of size of related and unrelated sets to k equals either 5 or -5.A083252
Numbers k for which abs(A045763(k) - A073757(k)) = 5, i.e., signed difference of size of related and unrelated sets to k equals either 5 or -5.
- Smallest number k for which abs(A045763(k) - A073757(k)) = n, i.e., signed difference of size of related and unrelated sets to k equals either n or -n.A083253
Smallest number k for which abs(A045763(k) - A073757(k)) = n, i.e., signed difference of size of related and unrelated sets to k equals either n or -n.
- a(n) = 2*phi(n) - n.A083254
a(n) = 2*phi(n) - n.
- Odd composite numbers k such that cototient(k) - phi(k) = k - 2*phi(k) is an odd prime.A083255
Odd composite numbers k such that cototient(k) - phi(k) = k - 2*phi(k) is an odd prime.
- a(n) = A046523(n-th nonprime number) = A046523(A018252(n)).A083256
a(n) = A046523(n-th nonprime number) = A046523(A018252(n)).
- a(n) = A071364(n-th nonprime number) = A071364(A018252(n)).A083257
a(n) = A071364(n-th nonprime number) = A071364(A018252(n)).
- a(n) = gcd(A046523(n), n).A083258
a(n) = gcd(A046523(n), n).
- a(n) = gcd(n, A071364(n)), where A071364(n) is the smallest number with same sequence of exponents in canonical prime factorization as n.A083259
a(n) = gcd(n, A071364(n)), where A071364(n) is the smallest number with same sequence of exponents in canonical prime factorization as n.
- a(n) = gcd(A046523(n), A071364(n)).A083260
a(n) = gcd(A046523(n), A071364(n)).