Sequences
392,541 sequences
- a(n) = A081210(A081210(n)).A081211
a(n) = A081210(A081210(n)).
- Let r(n,k) = if k=0 then n else r(A081210(n),k-1), then a(n) = Min{i:r(n,i) = r(n,i+1)}.A081212
Let r(n,k) = if k=0 then n else r(A081210(n),k-1), then a(n) = Min{i:r(n,i) = r(n,i+1)}.
- Let r(n,k) = if k=0 then n, else r(A081210(n),k-1), then a(n)=r(n, A081212(n)).A081213
Let r(n,k) = if k=0 then n, else r(A081210(n),k-1), then a(n)=r(n, A081212(n)).
- Least m such that A081212(m) = n.A081214
Least m such that A081212(m) = n.
- a(n) = (n^(n+1)+(-1)^n)/(n+1)^2.A081215
a(n) = (n^(n+1)+(-1)^n)/(n+1)^2.
- a(n) = (n^n-(-1)^n)/(n+1).A081216
a(n) = (n^n-(-1)^n)/(n+1).
- Greatest squarefree number not exceeding n-th prime power.A081217
Greatest squarefree number not exceeding n-th prime power.
- Greatest squarefree number not exceeding n-th prime power which is not prime.A081218
Greatest squarefree number not exceeding n-th prime power which is not prime.
- One sixtieth the product of primitive Pythagorean triangles' sides whose odd values differ by 2.A081219
One sixtieth the product of primitive Pythagorean triangles' sides whose odd values differ by 2.
- Palindromic primes = 1 mod 4.A081220
Palindromic primes = 1 mod 4.
- Number of consecutive numbers >= n having at least one square divisor > 1.A081221
Number of consecutive numbers >= n having at least one square divisor > 1.
- Smallest number m with Sum_{k=n..n+m} mu(k) = 0, where mu=A008683 (Möbius function).A081222
Smallest number m with Sum_{k=n..n+m} mu(k) = 0, where mu=A008683 (Möbius function).
- Smallest k such that floor(k*gamma) begins with n (gamma=0.5772156649...).A081223
Smallest k such that floor(k*gamma) begins with n (gamma=0.5772156649...).
- Smallest k such that floor(k*e^Pi) begins with n (e^Pi=23.14069264...).A081224
Smallest k such that floor(k*e^Pi) begins with n (e^Pi=23.14069264...).
- Floor( e * (3/2)^n ).A081225
Floor( e * (3/2)^n ).
- Floor( phi * (3/2)^n ) where phi = (1+sqrt(5))/2.A081226
Floor( phi * (3/2)^n ) where phi = (1+sqrt(5))/2.
- a(n) is the number of digits in common between n and the n-th prime in base 10.A081227
a(n) is the number of digits in common between n and the n-th prime in base 10.
- Partial sums of A081227.A081228
Partial sums of A081227.
- a(n) is the sum of the common digits of n and the n-th prime in base 10, or -1 if there are no common digits.A081229
a(n) is the sum of the common digits of n and the n-th prime in base 10, or -1 if there are no common digits.
- a(n) is the Levenshtein distance between n and n^n (where each is treated as a string).A081230
a(n) is the Levenshtein distance between n and n^n (where each is treated as a string).
- Let p = n-th prime of the form 4k+3, take smallest solution (x,y) to the Pellian equation x^2 - p*y^2 = 1 with x and y >= 1; sequence gives value of x.A081231
Let p = n-th prime of the form 4k+3, take smallest solution (x,y) to the Pellian equation x^2 - p*y^2 = 1 with x and y >= 1; sequence gives value of x.
- Let p = n-th prime of the form 4k+1, take smallest solution (x,y) to the Pellian equation x^2 - p*y^2 = 1 with x and y >= 1; sequence gives value of x.A081232
Let p = n-th prime of the form 4k+1, take smallest solution (x,y) to the Pellian equation x^2 - p*y^2 = 1 with x and y >= 1; sequence gives value of x.
- Let p = n-th prime, take smallest solution (x,y) to the Pellian equation x^2 - p*y^2 = 1 with x and y >= 1; sequence gives value of x.A081233
Let p = n-th prime, take smallest solution (x,y) to the Pellian equation x^2 - p*y^2 = 1 with x and y >= 1; sequence gives value of x.
- Let p = n-th prime, take smallest solution (x,y) to the Pellian equation x^2 - p*y^2 = 1 with x and y >= 1; sequence gives value of y.A081234
Let p = n-th prime, take smallest solution (x,y) to the Pellian equation x^2 - p*y^2 = 1 with x and y >= 1; sequence gives value of y.
- Smallest prime starting a sequence of 2n consecutive primes with symmetrical gaps about the center.A081235
Smallest prime starting a sequence of 2n consecutive primes with symmetrical gaps about the center.
- Greatest k<n with mu(n-k)=mu(n)=mu(n+k), where mu=A008683 (Moebius function).A081236
Greatest k<n with mu(n-k)=mu(n)=mu(n+k), where mu=A008683 (Moebius function).
- Numbers n with no k, 0<k<n, such that mu(n-k)=mu(n)=mu(n+k), where mu=A008683 (Moebius function).A081237
Numbers n with no k, 0<k<n, such that mu(n-k)=mu(n)=mu(n+k), where mu=A008683 (Moebius function).
- #{(i,j): mu(i)*mu(j) = -1, 1 <= i <= n, 1 <= j <= n}, where mu=A008683 (Moebius function).A081238
#{(i,j): mu(i)*mu(j) = -1, 1 <= i <= n, 1 <= j <= n}, where mu=A008683 (Moebius function).
- #{(i,j): mu(i)*mu(j) = 0, 1<=i,j<=n}, where mu=A008683 (Moebius function).A081239
#{(i,j): mu(i)*mu(j) = 0, 1<=i,j<=n}, where mu=A008683 (Moebius function).
- a(n) = #{(i,j): mu(i)*mu(j) = 1, 1<=i,j<=n}, where mu = A008683 (Moebius function).A081240
a(n) = #{(i,j): mu(i)*mu(j) = 1, 1<=i,j<=n}, where mu = A008683 (Moebius function).
- Position in B of reversal of n-th term of B, where B is the logic-binary sequence, A007931.A081241
Position in B of reversal of n-th term of B, where B is the logic-binary sequence, A007931.
- Left-to-right binary enumeration.A081242
Left-to-right binary enumeration.
- a(n) = Mod[n+(Mod[Prime[n],3]-1),10].A081243
a(n) = Mod[n+(Mod[Prime[n],3]-1),10].
- Named periods in the Mayan/Mesoamerican calendars.A081244
Named periods in the Mayan/Mesoamerican calendars.
- Number of days in months in the Haab year of Mayan/Mesoamerican calendars.A081245
Number of days in months in the Haab year of Mayan/Mesoamerican calendars.
- Triangle in which (2^n+1)-st row gives trajectory of x=2^n+1 under the map x -> x/2 if x is even, x -> x+1 if x is odd, stopping when reaching 1.A081246
Triangle in which (2^n+1)-st row gives trajectory of x=2^n+1 under the map x -> x/2 if x is even, x -> x+1 if x is odd, stopping when reaching 1.
- Number of numbers 1<=k<=n with mu(k+n)=mu(k), where mu=A008683 (Moebius function).A081247
Number of numbers 1<=k<=n with mu(k+n)=mu(k), where mu=A008683 (Moebius function).
- Number of numbers 1<=k<=n with mu(k+n)+mu(k)=0, where mu=A008683 (Moebius function).A081248
Number of numbers 1<=k<=n with mu(k+n)+mu(k)=0, where mu=A008683 (Moebius function).
- Partial sums of A081134.A081249
Partial sums of A081134.
- Numbers k such that A081249(m)/m^2 has a local minimum for m = k.A081250
Numbers k such that A081249(m)/m^2 has a local minimum for m = k.
- Numbers n such that A081249(m)/m^2 has a local maximum for m = n.A081251
Numbers n such that A081249(m)/m^2 has a local maximum for m = n.
- Partial sums of A053646.A081252
Partial sums of A053646.
- Numbers k such that A081252(m)/m^2 has a local minimum for m = k.A081253
Numbers k such that A081252(m)/m^2 has a local minimum for m = k.
- Numbers k such that A081252(m)/m^2 has a local maximum for m = k.A081254
Numbers k such that A081252(m)/m^2 has a local maximum for m = k.
- Duplicate of A005371.A081255
Duplicate of A005371.
- Greatest prime factor of n^3 + 1.A081256
Greatest prime factor of n^3 + 1.
- a(n) is the greatest prime factor of (n^3 - 1).A081257
a(n) is the greatest prime factor of (n^3 - 1).
- Numbers k > 1 such that k^3 - 1 (or equivalently k^2 + k + 1) has no prime factor greater than k.A081258
Numbers k > 1 such that k^3 - 1 (or equivalently k^2 + k + 1) has no prime factor greater than k.
- a(n) is the smallest k such that C(3n,n) divides k!.A081259
a(n) is the smallest k such that C(3n,n) divides k!.
- a(1)=4; for n>1, a(n) is taken to be the third-smallest integer greater than a(n-1) such that the condition "n is a member of the sequence if and only if a(n) is odd" is satisfied.A081260
a(1)=4; for n>1, a(n) is taken to be the third-smallest integer greater than a(n-1) such that the condition "n is a member of the sequence if and only if a(n) is odd" is satisfied.