Sequences
392,541 sequences
- Number of squarefree numbers in the reduced residue system of n.A073311
Number of squarefree numbers in the reduced residue system of n.
- Number of nonsquarefree numbers in the reduced residue system of n.A073312
Number of nonsquarefree numbers in the reduced residue system of n.
- Binomial transform of generalized Lucas numbers S(n) = S(n-1) + S(n-2) + S(n-3), S(0)=3, S(1)=1, S(2)=3.A073313
Binomial transform of generalized Lucas numbers S(n) = S(n-1) + S(n-2) + S(n-3), S(0)=3, S(1)=1, S(2)=3.
- Binomial transform, alternating in sign, of Lucas generalized numbers S(n): S(n) = S(n-1) + S(n-2) + S(n-3), S(0)=3, S(1)=1, S(2)=3.A073314
Binomial transform, alternating in sign, of Lucas generalized numbers S(n): S(n) = S(n-1) + S(n-2) + S(n-3), S(0)=3, S(1)=1, S(2)=3.
- Expansion of Lambert W function in powers of log(log(x))/log(x).A073315
Expansion of Lambert W function in powers of log(log(x))/log(x).
- a(n) = Max d(j), j=1..n-1, where d(j) is the smallest positive number such that 2j+d(j) and 2n+d(j) are both prime. A generalization of A073310.A073316
a(n) = Max d(j), j=1..n-1, where d(j) is the smallest positive number such that 2j+d(j) and 2n+d(j) are both prime. A generalization of A073310.
- a(n)=Sum_{j = 0..n} binomial(phi(n),phi(j)).A073317
a(n)=Sum_{j = 0..n} binomial(phi(n),phi(j)).
- a(n) = 2^phi(n) - Sum_{j=0..n} binomial(phi(n), phi(j)).A073318
a(n) = 2^phi(n) - Sum_{j=0..n} binomial(phi(n), phi(j)).
- Numbers n such that A073318(n) = 2^phi(n) - Sum_{j=0..n} binomial(phi(n), phi(j)) is positive.A073319
Numbers n such that A073318(n) = 2^phi(n) - Sum_{j=0..n} binomial(phi(n), phi(j)) is positive.
- A073259(n)=3: the length of iteration transient leading to n-th composite number equals 3.A073320
A073259(n)=3: the length of iteration transient leading to n-th composite number equals 3.
- a(n)=A073259[A000040(n)]; Length of FixedPointList started with n-th prime and leading to corresponding composite number.A073321
a(n)=A073259[A000040(n)]; Length of FixedPointList started with n-th prime and leading to corresponding composite number.
- a(n)=A073259[A002808(n)] and a(0)=3; Length of FixedPointList started with n-th nonprime and leading to corresponding composite number= c[c(n)].A073322
a(n)=A073259[A002808(n)] and a(0)=3; Length of FixedPointList started with n-th nonprime and leading to corresponding composite number= c[c(n)].
- Smallest k such that A073259(k)=n or 0 if there is no such value; the first number of which length of fixed-point-list terminated by k-th composite number equals n.A073323
Smallest k such that A073259(k)=n or 0 if there is no such value; the first number of which length of fixed-point-list terminated by k-th composite number equals n.
- Smallest x such that prime(x) mod c(x) = n, where prime(j) is the j-th prime, c(j) is the j-th composite number.A073324
Smallest x such that prime(x) mod c(x) = n, where prime(j) is the j-th prime, c(j) is the j-th composite number.
- a(n) = least k > 0 such that prime(k) == n (mod k).A073325
a(n) = least k > 0 such that prime(k) == n (mod k).
- Smallest x such that prime(x) == n (mod (x-pi(x)-1)).A073326
Smallest x such that prime(x) == n (mod (x-pi(x)-1)).
- Write U.S. English name for n (ignoring hyphens and spaces) and add numerical values of letters using a=1, b=2, ..., y=25, z=26.A073327
Write U.S. English name for n (ignoring hyphens and spaces) and add numerical values of letters using a=1, b=2, ..., y=25, z=26.
- Numbers n such that S(n) is a palindromic prime, where S(n) is the Kempner function A002034.A073328
Numbers n such that S(n) is a palindromic prime, where S(n) is the Kempner function A002034.
- a(n) is the n-th number to have n distinct prime factors.A073329
a(n) is the n-th number to have n distinct prime factors.
- Let c(1)=n and c(k+1)=floor(c(k)/Pi) if c(k) is even, or c(k+1)=floor(Pi*c(k)) otherwise; sequence gives the smallest value a(n) such that c(a(n))=0.A073330
Let c(1)=n and c(k+1)=floor(c(k)/Pi) if c(k) is even, or c(k+1)=floor(Pi*c(k)) otherwise; sequence gives the smallest value a(n) such that c(a(n))=0.
- Smallest k such that S(n) = d(n+k), where S(n) is the Kempner function (A002034) and d(n) is the number of divisors of n (A000005).A073331
Smallest k such that S(n) = d(n+k), where S(n) is the Kempner function (A002034) and d(n) is the number of divisors of n (A000005).
- Composite solutions to S(n) = rad(n), where S() is A002034 and rad() is A007947.A073332
Composite solutions to S(n) = rad(n), where S() is A002034 and rad() is A007947.
- Decimal expansion of 1/(e - 1) = Sum_{k >= 1} exp(-k).A073333
Decimal expansion of 1/(e - 1) = Sum_{k >= 1} exp(-k).
- The so-called "rhythmic infinity system" of Danish composer Per Nørgård [Noergaard].A073334
The so-called "rhythmic infinity system" of Danish composer Per Nørgård [Noergaard].
- Total number of prime power parts in all partitions of n.A073335
Total number of prime power parts in all partitions of n.
- Total number of square parts in all partitions of n.A073336
Total number of square parts in all partitions of n.
- Primes of the form 4*k^2 - 10*k + 7 with k positive.A073337
Primes of the form 4*k^2 - 10*k + 7 with k positive.
- Positive values of n for which 4n^2-10n+7 is prime.A073338
Positive values of n for which 4n^2-10n+7 is prime.
- Define b(k) by the recursion b(1)=n, b(k+1)=b(k)-trunc(k/b(k)), where trunc(x) is floor(x) for x>=0, ceiling(x) for x<0. Sequence gives the value a(n) such that b(a(n))=0; if k>a(n) then b(k) is undefined.A073339
Define b(k) by the recursion b(1)=n, b(k+1)=b(k)-trunc(k/b(k)), where trunc(x) is floor(x) for x>=0, ceiling(x) for x<0. Sequence gives the value a(n) such that b(a(n))=0; if k>a(n) then b(k) is undefined.
- Fibonacci prime pairs: the indices of each pair differ by two and the relevant Fibonacci numbers are both prime.A073340
Fibonacci prime pairs: the indices of each pair differ by two and the relevant Fibonacci numbers are both prime.
- Number of steps to reach an integer starting with (2n+1)/4 and iterating the map x -> x*ceiling(x).A073341
Number of steps to reach an integer starting with (2n+1)/4 and iterating the map x -> x*ceiling(x).
- Average digit (rounded to the nearest integer) in the decimal expansion of n-th prime.A073342
Average digit (rounded to the nearest integer) in the decimal expansion of n-th prime.
- Number of permutations p of (1,2,3,...,n) such that Sum_{k=1..n} gcd(k,p(k)) = sigma(n).A073343
Number of permutations p of (1,2,3,...,n) such that Sum_{k=1..n} gcd(k,p(k)) = sigma(n).
- Number of permutations p of (1,2,3,...,n) such that Sum_{k=1..n} (p(k) mod k) = n.A073344
Number of permutations p of (1,2,3,...,n) such that Sum_{k=1..n} (p(k) mod k) = n.
- Table T(n,k), read by ascending antidiagonals, giving the number of rooted plane binary trees of size n and height k.A073345
Table T(n,k), read by ascending antidiagonals, giving the number of rooted plane binary trees of size n and height k.
- Table T(n,k) (listed antidiagonalwise in order T(0,0), T(1,0), T(0,1), T(2,0), T(1,1), ...) giving the number of rooted plane binary trees of size n and "contracted height" k.A073346
Table T(n,k) (listed antidiagonalwise in order T(0,0), T(1,0), T(0,1), T(2,0), T(1,1), ...) giving the number of rooted plane binary trees of size n and "contracted height" k.
- a(1)=1; a(n+1) is the smallest integer > a(n) such that Sum_{k=a(n)..a(n+1)} 1/sqrt(k) > Pi.A073347
a(1)=1; a(n+1) is the smallest integer > a(n) such that Sum_{k=a(n)..a(n+1)} 1/sqrt(k) > Pi.
- Least k such that sigma(k)/k >= sigma(n)/n.A073348
Least k such that sigma(k)/k >= sigma(n)/n.
- Numbers m such that sigma(m)/m is equal to sigma(k)/k for some k being superabundant (A004394).A073349
Numbers m such that sigma(m)/m is equal to sigma(k)/k for some k being superabundant (A004394).
- Primes not at the center of a 3 X 3 magic square of primes.A073350
Primes not at the center of a 3 X 3 magic square of primes.
- n^2(n+1)(2n+1)^2(7n+1)/36.A073351
n^2(n+1)(2n+1)^2(7n+1)/36.
- Positive integers making n^2*(n-1)*(2*n-1)^2*(7*n-1)/36 a square.A073352
Positive integers making n^2*(n-1)*(2*n-1)^2*(7*n-1)/36 a square.
- Sum of n and its squarefree kernel.A073353
Sum of n and its squarefree kernel.
- Binomial coefficient ( n, squarefree kernel(n) ).A073354
Binomial coefficient ( n, squarefree kernel(n) ).
- Sum of squarefree kernels of numbers <= n.A073355
Sum of squarefree kernels of numbers <= n.
- Greatest common divisor of squarefree kernel of n and sum of squarefree kernels of numbers <= n.A073356
Greatest common divisor of squarefree kernel of n and sum of squarefree kernels of numbers <= n.
- Binomial transform of tribonacci numbers.A073357
Binomial transform of tribonacci numbers.
- Binomial transform, alternating in sign, of the tribonacci numbers.A073358
Binomial transform, alternating in sign, of the tribonacci numbers.
- Nested floor product of n and fractions (2k+2)/(2k+1) for all k>=0, divided by 2.A073359
Nested floor product of n and fractions (2k+2)/(2k+1) for all k>=0, divided by 2.
- Nested floor product of n and fractions (k+1)/k for all k>0 (mod 3), divided by 3.A073360
Nested floor product of n and fractions (k+1)/k for all k>0 (mod 3), divided by 3.