Sequences
392,541 sequences
- a(n) = gcd(A046523(n+1), A046523(n)).A083261
a(n) = gcd(A046523(n+1), A046523(n)).
- a(n) = sigma(A046523(n)), sum of divisors of the least number with the same prime signature as n.A083262
a(n) = sigma(A046523(n)), sum of divisors of the least number with the same prime signature as n.
- Numbers k such that the difference of the largest and smallest prime factors of k divides k.A083263
Numbers k such that the difference of the largest and smallest prime factors of k divides k.
- Numbers k such that the difference d of the largest and smallest prime factors of k is a composite divisor of k.A083264
Numbers k such that the difference d of the largest and smallest prime factors of k is a composite divisor of k.
- Duplicate of A067391.A083265
Duplicate of A067391.
- Sum of related numbers (counted in A073757) belonging to n: a(n) = A000203(n) + A023896(n) - 1; related = {divisor-set, RRS}.A083266
Sum of related numbers (counted in A073757) belonging to n: a(n) = A000203(n) + A023896(n) - 1; related = {divisor-set, RRS}.
- Product of related numbers (counted in A073757) belonging to n; related = {divisor-set, RRS}: a(n) = A007955(n)*A001783(n).A083267
Product of related numbers (counted in A073757) belonging to n; related = {divisor-set, RRS}: a(n) = A007955(n)*A001783(n).
- a(n) is the lcm of related numbers to n (counted in A073757): related = {divisor-set, RRS}.A083268
a(n) is the lcm of related numbers to n (counted in A073757): related = {divisor-set, RRS}.
- a(n) = pi(A052180(n)) = A000720(A052180(n)); subscript of last prime used in Eratosthenes sieve by which all composites between n-th and (n+1)th primes were excluded.A083269
a(n) = pi(A052180(n)) = A000720(A052180(n)); subscript of last prime used in Eratosthenes sieve by which all composites between n-th and (n+1)th primes were excluded.
- Duplicate of A000879.A083270
Duplicate of A000879.
- a(n) = n*tau(n) + 1.A083271
a(n) = n*tau(n) + 1.
- a(n) = n*tau(a(n-1)) + 1 = n*A000005(a(n-1)) + 1, a(0) = 1.A083272
a(n) = n*tau(a(n-1)) + 1 = n*A000005(a(n-1)) + 1, a(0) = 1.
- a(n) is the quotient of lcm of first n consecutive prime differences and A001223(n), the n-th difference between consecutive primes.A083273
a(n) is the quotient of lcm of first n consecutive prime differences and A001223(n), the n-th difference between consecutive primes.
- Duplicate of A067913.A083274
Duplicate of A067913.
- a(n) = smallest number not occurring earlier such that a(1)*a(2)*...*a(n) - 1 is prime.A083275
a(n) = smallest number not occurring earlier such that a(1)*a(2)*...*a(n) - 1 is prime.
- Number of distinct chess positions after n plies including differences due to availability and possibility of castling and en passant captures.A083276
Number of distinct chess positions after n plies including differences due to availability and possibility of castling and en passant captures.
- k appears 3k-2 times.A083277
k appears 3k-2 times.
- Repunit powers.A083278
Repunit powers.
- Length of odd/even runs in A061419, where a(2n)=length of n-th run of even numbers in A061419 and a(2n-1)=length of n-th run of odd numbers.A083279
Length of odd/even runs in A061419, where a(2n)=length of n-th run of even numbers in A061419 and a(2n-1)=length of n-th run of odd numbers.
- Number of 2-generator non-Abelian groups of order n.A083280
Number of 2-generator non-Abelian groups of order n.
- Decimal expansion of h = Product_{p prime}(sqrt(p(p-1))*log(1/(1-1/p))).A083281
Decimal expansion of h = Product_{p prime}(sqrt(p(p-1))*log(1/(1-1/p))).
- a(n) = n^(3*n).A083282
a(n) = n^(3*n).
- Engel expansion for i^i = exp(-Pi/2).A083283
Engel expansion for i^i = exp(-Pi/2).
- Numbers m such that m and m+2 are both brilliant numbers, where brilliant numbers are semiprimes whose prime factors have an equal number of decimal digits, or whose prime factors are equal.A083284
Numbers m such that m and m+2 are both brilliant numbers, where brilliant numbers are semiprimes whose prime factors have an equal number of decimal digits, or whose prime factors are equal.
- Numbers n such that n and n+4 are both brilliant numbers (A078972).A083285
Numbers n such that n and n+4 are both brilliant numbers (A078972).
- Decimal expansion of K(3), a constant related to the Josephus problem.A083286
Decimal expansion of K(3), a constant related to the Josephus problem.
- Continued fraction expansion of K(3), a constant related to the Josephus problem.A083287
Continued fraction expansion of K(3), a constant related to the Josephus problem.
- Sigma unitary-sigma perfect numbers: numbers m which satisfy the following equation for some integer k: sigma(usigma(m)) = k*m where usigma(m) is sum of unitary divisors of m.A083288
Sigma unitary-sigma perfect numbers: numbers m which satisfy the following equation for some integer k: sigma(usigma(m)) = k*m where usigma(m) is sum of unitary divisors of m.
- Least k such that 10^n+k is a brilliant number (cf. A078972).A083289
Least k such that 10^n+k is a brilliant number (cf. A078972).
- Number of partitions of n into distinct parts which are coprime to n and which are also pairwise relatively prime.A083290
Number of partitions of n into distinct parts which are coprime to n and which are also pairwise relatively prime.
- Triangular array read by rows: T(n,k) = k*floor(n/10) + n mod 10, 0<=k<=n.A083291
Triangular array read by rows: T(n,k) = k*floor(n/10) + n mod 10, 0<=k<=n.
- a(n) = n*floor(n/10) + (n mod 10).A083292
a(n) = n*floor(n/10) + (n mod 10).
- e = Sum_{n>=0} a(n) / 2^n / n!.A083293
e = Sum_{n>=0} a(n) / 2^n / n!.
- a(n) = (4 + (-9)^n)/5.A083294
a(n) = (4 + (-9)^n)/5.
- a(n) = (4*2^n + (-8)^n)/5.A083295
a(n) = (4*2^n + (-8)^n)/5.
- a(n) = (4*3^n + (-7)^n)/5.A083296
a(n) = (4*3^n + (-7)^n)/5.
- a(n) = (4*4^n + (-6)^n)/5.A083297
a(n) = (4*4^n + (-6)^n)/5.
- Duplicate of A083222.A083298
Duplicate of A083222.
- a(n) = (4*6^n + (-4)^n)/5.A083299
a(n) = (4*6^n + (-4)^n)/5.
- a(n) = (4*7^n + (-3)^n)/5.A083300
a(n) = (4*7^n + (-3)^n)/5.
- a(n) = (4*8^n + (-2)^n)/5.A083301
a(n) = (4*8^n + (-2)^n)/5.
- a(n) = (4*9^n + (-1)^n)/5.A083302
a(n) = (4*9^n + (-1)^n)/5.
- Let Pi= sum(k>=0, u(k)/k!) where u(k)>=0 are integer (u(k)=A075874(k)), then sequence gives values of m such that u(m)=0.A083303
Let Pi= sum(k>=0, u(k)/k!) where u(k)>=0 are integer (u(k)=A075874(k)), then sequence gives values of m such that u(m)=0.
- a(n) = (4*(n+5)^n + n^n)/5.A083304
a(n) = (4*(n+5)^n + n^n)/5.
- a(n) = (4*(n+10)^n+n^n)/5.A083305
a(n) = (4*(n+10)^n+n^n)/5.
- a(n) = (4*(n+15)^n + n^n)/5.A083306
a(n) = (4*(n+15)^n + n^n)/5.
- a(n) = (4*n^n + (n-10)^n)/5.A083307
a(n) = (4*n^n + (n-10)^n)/5.
- a(n) = (4*(n+1)^n + (n-9)^n)/5.A083308
a(n) = (4*(n+1)^n + (n-9)^n)/5.
- a(n) is the number of times that sums 3 +- 5 +- 7 +- 11 +- ... +- prime(2n+1) of the first 2n odd primes is zero. There are 2^(2n-1) choices for the sign patterns.A083309
a(n) is the number of times that sums 3 +- 5 +- 7 +- 11 +- ... +- prime(2n+1) of the first 2n odd primes is zero. There are 2^(2n-1) choices for the sign patterns.
- Least number greater than n that contains all the decimal digits of n.A083310
Least number greater than n that contains all the decimal digits of n.