Sequences
392,541 sequences
- Numbers k such that (-k!! + (k+1)!! - 1)/2 is prime.A076211
Numbers k such that (-k!! + (k+1)!! - 1)/2 is prime.
- Numbers k such that k and Fibonacci(k) have the same number of prime factors, counted with multiplicity.A076212
Numbers k such that k and Fibonacci(k) have the same number of prime factors, counted with multiplicity.
- 2*a(n)-1 = sign(A005132(n+1)-A005132(n)).A076213
2*a(n)-1 = sign(A005132(n+1)-A005132(n)).
- Decimal expansion of C = Sum_{k>=0} 1/2^(2^k-1).A076214
Decimal expansion of C = Sum_{k>=0} 1/2^(2^k-1).
- Square root of sum defined in A007475(n) and A001032(n).A076215
Square root of sum defined in A007475(n) and A001032(n).
- Partial sum of coefficients in the continued fraction expansion of sum(k>=0,1/2^(2^k-1)).A076216
Partial sum of coefficients in the continued fraction expansion of sum(k>=0,1/2^(2^k-1)).
- a(1)=1, a(n) = a(n-1) + n * sign(n-a(n-1)).A076217
a(1)=1, a(n) = a(n-1) + n * sign(n-a(n-1)).
- Numbers n such that 2*n^2 - 3*n + 1 is a square.A076218
Numbers n such that 2*n^2 - 3*n + 1 is a square.
- Smallest positive integer m such that m! begins with n in base 10.A076219
Smallest positive integer m such that m! begins with n in base 10.
- Number of permutations of 1..n in which every pair of adjacent numbers are relatively prime.A076220
Number of permutations of 1..n in which every pair of adjacent numbers are relatively prime.
- Triangle read by rows: A(n,k) is the number of x, x<=n, which are coprime to and not equal to k.A076221
Triangle read by rows: A(n,k) is the number of x, x<=n, which are coprime to and not equal to k.
- Number of different values in n-th row of A076221.A076222
Number of different values in n-th row of A076221.
- Minimum of n-th row of A076221.A076223
Minimum of n-th row of A076221.
- Counts of the minimum value in n-th row of A076221.A076224
Counts of the minimum value in n-th row of A076221.
- Counts of the maximum value in n-th row of A076221.A076225
Counts of the maximum value in n-th row of A076221.
- Numbers m such that the largest of the most frequent values in m-th row of A076221 is different from m-1.A076226
Numbers m such that the largest of the most frequent values in m-th row of A076221 is different from m-1.
- Number of surviving Collatz residues mod 2^n.A076227
Number of surviving Collatz residues mod 2^n.
- Number of terms k in the trajectory of the Collatz function applied to n such that k < n.A076228
Number of terms k in the trajectory of the Collatz function applied to n such that k < n.
- Smallest number such that A076228(a(n)) = n.A076229
Smallest number such that A076228(a(n)) = n.
- Numbers k such that sigma_2(k)/k and sigma_4(k)/k are integers.A076230
Numbers k such that sigma_2(k)/k and sigma_4(k)/k are integers.
- Numbers k such that sigma(k)/k, sigma_3(k)/k and sigma_5(k)/k are all integers.A076231
Numbers k such that sigma(k)/k, sigma_3(k)/k and sigma_5(k)/k are all integers.
- a(n) = prime(1+n!) - prime(n!).A076232
a(n) = prime(1+n!) - prime(n!).
- Numbers k such that sigma(k)/k and sigma_3(k)/k are both integers.A076233
Numbers k such that sigma(k)/k and sigma_3(k)/k are both integers.
- Numbers k such that sigma(k)/k, sigma_3(k)/k, sigma_5(k)/k and sigma_7(k)/k are all integers.A076234
Numbers k such that sigma(k)/k, sigma_3(k)/k, sigma_5(k)/k and sigma_7(k)/k are all integers.
- Least of the least frequent values in rows of A076221.A076235
Least of the least frequent values in rows of A076221.
- a(n) = A050435(n) mod A002808(n).A076236
a(n) = A050435(n) mod A002808(n).
- a(n) = A050435(n) mod n.A076237
a(n) = A050435(n) mod n.
- a(n) = A050436(n) mod A002808(n).A076238
a(n) = A050436(n) mod A002808(n).
- Remainder when 3rd-order composite ccc(n) = A050436(n) is divided by n.A076239
Remainder when 3rd-order composite ccc(n) = A050436(n) is divided by n.
- Remainder when 2nd order prime pp(n) = A006450(n) is divided by n-th prime = A000040(n).A076240
Remainder when 2nd order prime pp(n) = A006450(n) is divided by n-th prime = A000040(n).
- Remainder when 2nd order prime pp(n)=A006450(n) is divided by n.A076241
Remainder when 2nd order prime pp(n)=A006450(n) is divided by n.
- Remainder when 3rd order prime A038580(n) is divided by n-th prime=A000040(n).A076242
Remainder when 3rd order prime A038580(n) is divided by n-th prime=A000040(n).
- Remainder when 3rd-order prime ppp(n) = A038580(n) is divided by n.A076243
Remainder when 3rd-order prime ppp(n) = A038580(n) is divided by n.
- Distinct values arising in A051547, sequence of a(n) = lcm(phi(1), ..., phi(n)).A076244
Distinct values arising in A051547, sequence of a(n) = lcm(phi(1), ..., phi(n)).
- Positions of records in A051547.A076245
Positions of records in A051547.
- Totients of those numbers at which values of A051547 increase: in these consecutive terms new prime powers arise, i.e., which did not occur in neither of preceding terms.A076246
Totients of those numbers at which values of A051547 increase: in these consecutive terms new prime powers arise, i.e., which did not occur in neither of preceding terms.
- Trajectory of 1059774 under the Reverse and Add! operation carried out in base 4, written in base 10.A076247
Trajectory of 1059774 under the Reverse and Add! operation carried out in base 4, written in base 10.
- Trajectory of 1059831 under the Reverse and Add! operation carried out in base 4, written in base 10.A076248
Trajectory of 1059831 under the Reverse and Add! operation carried out in base 4, written in base 10.
- Distance between maxima of the cototient function.A076249
Distance between maxima of the cototient function.
- Distance between maxima of the cototient function, divided by 6, starting at n=5.A076250
Distance between maxima of the cototient function, divided by 6, starting at n=5.
- Numbers m such that omega(m) = omega(m-1) + omega(m-2), where omega(m) is the number of distinct prime factors of m.A076251
Numbers m such that omega(m) = omega(m-1) + omega(m-2), where omega(m) is the number of distinct prime factors of m.
- Integers k such that omega(k) = omega(k-1) + omega(k-2) + omega(k-3), where omega(n) is the number of distinct prime factors of n.A076252
Integers k such that omega(k) = omega(k-1) + omega(k-2) + omega(k-3), where omega(n) is the number of distinct prime factors of n.
- a(n) = the least positive integer solution of the "n-th omega recurrence" omega(k) = omega(k-1) + ... + omega(k-n), if such k exists; = 0 otherwise. (omega(n) denotes the number of distinct prime factors of n.)A076253
a(n) = the least positive integer solution of the "n-th omega recurrence" omega(k) = omega(k-1) + ... + omega(k-n), if such k exists; = 0 otherwise. (omega(n) denotes the number of distinct prime factors of n.)
- A list of six integers with property that for every 3 numbers a,b,c from the list axbxc is an integer, where axb=a*b/(a+b) and axbxc=a*b*c/(a*b+a*c+b*c). This is the so-called replus operation.A076254
A list of six integers with property that for every 3 numbers a,b,c from the list axbxc is an integer, where axb=a*b/(a+b) and axbxc=a*b*c/(a*b+a*c+b*c). This is the so-called replus operation.
- a(n) = floor(t^n), where t=3450844193^(1/9) (approximately 11.4754).A076255
a(n) = floor(t^n), where t=3450844193^(1/9) (approximately 11.4754).
- Coefficients of the polynomials in the numerator of 1/(1+x^2) and its successive derivatives, starting with the constant term.A076256
Coefficients of the polynomials in the numerator of 1/(1+x^2) and its successive derivatives, starting with the constant term.
- Coefficients of the polynomials in the numerator of 1/(1+x^2) and its successive derivatives, starting with the coefficient of the highest power of x.A076257
Coefficients of the polynomials in the numerator of 1/(1+x^2) and its successive derivatives, starting with the coefficient of the highest power of x.
- a(n) = 2 * Sum_{k=1..n} A076213(k) - n.A076258
a(n) = 2 * Sum_{k=1..n} A076213(k) - n.
- Gaps between squarefree numbers: a(n) = A005117(n+1) - A005117(n).A076259
Gaps between squarefree numbers: a(n) = A005117(n+1) - A005117(n).
- a(n) = 0 if n is a squarefree number, otherwise the distance between the two nearest squarefree numbers around n: A067535(n)-A070321(n).A076260
a(n) = 0 if n is a squarefree number, otherwise the distance between the two nearest squarefree numbers around n: A067535(n)-A070321(n).