Sequences
392,541 sequences
- Ratio A095110(n)/A000079(n-2) rounded down.A095361
Ratio A095110(n)/A000079(n-2) rounded down.
- Ratio A095110(n)/A000079(n-2) rounded to nearest integer.A095362
Ratio A095110(n)/A000079(n-2) rounded to nearest integer.
- a(n) = (-1)^n*b(2n-1,2) where b(n,p) = Sum_{k=0..n} p^k*C(2*k,k)*C(n+k,n-k)*B(k) and B(k) = k-th Bernoulli number.A095363
a(n) = (-1)^n*b(2n-1,2) where b(n,p) = Sum_{k=0..n} p^k*C(2*k,k)*C(n+k,n-k)*B(k) and B(k) = k-th Bernoulli number.
- Number of walks of length n between two adjacent nodes in the cycle graph C_9.A095364
Number of walks of length n between two adjacent nodes in the cycle graph C_9.
- Primes p such that f(q) < f(p) for all primes q < p, where f(p) = lcm(2-1, 3-1, 5-1, 7-1, 11-1, ..., p-1).A095365
Primes p such that f(q) < f(p) for all primes q < p, where f(p) = lcm(2-1, 3-1, 5-1, 7-1, 11-1, ..., p-1).
- Least k > 1 such that k divides 1^n + 2^n +...+ (k-1)^n.A095366
Least k > 1 such that k divides 1^n + 2^n +...+ (k-1)^n.
- Number of walks of length n between two nodes at distance 2 in the cycle graph C_9.A095367
Number of walks of length n between two nodes at distance 2 in the cycle graph C_9.
- Number of walks of length n between two nodes at distance 3 in the cycle graph C_9.A095368
Number of walks of length n between two nodes at distance 3 in the cycle graph C_9.
- Number of walks of length n between two nodes at distance 4 in the cycle graph C_9.A095369
Number of walks of length n between two nodes at distance 4 in the cycle graph C_9.
- Number of distinct prime factors of the repunit (-1 + 10^n)/9.A095370
Number of distinct prime factors of the repunit (-1 + 10^n)/9.
- Number of distinct prime factors of record setting repunits (A328899).A095371
Number of distinct prime factors of record setting repunits (A328899).
- 1+integers repeating "90" decimal digit pattern.A095372
1+integers repeating "90" decimal digit pattern.
- Integers k such that A095372(k) = 1 + 90*(-1+100^k)/99 is prime.A095373
Integers k such that A095372(k) = 1 + 90*(-1+100^k)/99 is prime.
- One less than the number of divisors of 2*n + 1.A095374
One less than the number of divisors of 2*n + 1.
- Total number of 1's in the binary expansions of the first n primes: summatory A014499.A095375
Total number of 1's in the binary expansions of the first n primes: summatory A014499.
- Values of k such that the total number of 1's in the binary expansions of the first k integers is a multiple of k.A095376
Values of k such that the total number of 1's in the binary expansions of the first k integers is a multiple of k.
- Values of k such that the total number of 1's in the binary expansions of the first k primes is a multiple of k.A095377
Values of k such that the total number of 1's in the binary expansions of the first k primes is a multiple of k.
- Integers k for which 1 + A094125(k) = 1 + 3*2^k + 2*3^k is prime.A095378
Integers k for which 1 + A094125(k) = 1 + 3*2^k + 2*3^k is prime.
- Primes of the form 1 + A094125(k) = 1 + 3*2^k + 2*3^k.A095379
Primes of the form 1 + A094125(k) = 1 + 3*2^k + 2*3^k.
- Number of integers not exceeding 2^n that are impossible as sum-of-divisors of other numbers.A095380
Number of integers not exceeding 2^n that are impossible as sum-of-divisors of other numbers.
- Initial values for 3x+1 trajectories in which the largest term arising in the iteration is a power of 2.A095381
Initial values for 3x+1 trajectories in which the largest term arising in the iteration is a power of 2.
- Exponents of power of 2 of the largest terms arising in the 3x+1 iterations started with terms of A095381.A095382
Exponents of power of 2 of the largest terms arising in the 3x+1 iterations started with terms of A095381.
- Number of different initial values for 3x+1 trajectories started with initial values not exceeding 2^n and in which the peak values are larger than 2^n.A095383
Number of different initial values for 3x+1 trajectories started with initial values not exceeding 2^n and in which the peak values are larger than 2^n.
- Number of different initial values for 3x+1 trajectories started with initial values not exceeding 2^n and in which the peak values are also not larger than 2^n.A095384
Number of different initial values for 3x+1 trajectories started with initial values not exceeding 2^n and in which the peak values are also not larger than 2^n.
- Numbers k with property that k is a peak value in 3x+1 trajectory such that both k+1 and k-1 are prime numbers.A095385
Numbers k with property that k is a peak value in 3x+1 trajectory such that both k+1 and k-1 are prime numbers.
- Largest prime factor of peak values of 3x+1 trajectory started at n.A095386
Largest prime factor of peak values of 3x+1 trajectory started at n.
- Initial values for 3x+1 trajectories of which the largest term is 9232.A095387
Initial values for 3x+1 trajectories of which the largest term is 9232.
- Smallest multiple of 2^n whose Collatz (3x+1) trajectory includes at least one larger number.A095388
Smallest multiple of 2^n whose Collatz (3x+1) trajectory includes at least one larger number.
- a(n) is the number of residues from reduced residue system, R, modulo 210 such that both R and R+2 are primes, i.e., both 210n+r and 210n+r+2 are primes at fixed n.A095389
a(n) is the number of residues from reduced residue system, R, modulo 210 such that both R and R+2 are primes, i.e., both 210n+r and 210n+r+2 are primes at fixed n.
- Least inverse of A095389.A095390
Least inverse of A095389.
- a(n) is the least x such that A094892(x)=n.A095391
a(n) is the least x such that A094892(x)=n.
- Numbers n such that more than half of the reduced-residue system modulo 210 consists of primes in the following sense: in {210n + R} more than 24 = phi(210)/2 primes occur, i.e., 25-33, 35, 46.A095392
Numbers n such that more than half of the reduced-residue system modulo 210 consists of primes in the following sense: in {210n + R} more than 24 = phi(210)/2 primes occur, i.e., 25-33, 35, 46.
- Terms n are such that exactly half[=24] of the {210n+r} set is prime. Here r runs through the reduced residue system mod 210 (RRS[210]).A095393
Terms n are such that exactly half[=24] of the {210n+r} set is prime. Here r runs through the reduced residue system mod 210 (RRS[210]).
- a(n) = Floor[n^((n)/(n+1))], integer part of n^x where x = n/(n+1) < 1.A095394
a(n) = Floor[n^((n)/(n+1))], integer part of n^x where x = n/(n+1) < 1.
- a(n) = floor(n^((n+1)/(n))) - floor(n^((n)/(n+1))).A095395
a(n) = floor(n^((n+1)/(n))) - floor(n^((n)/(n+1))).
- Modified juggler map: for even numbers: a(n) = floor(n^(2/3)) and for odd n: a(n) = floor(n^(3/2)) = floor(sqrt(n^3)).A095396
Modified juggler map: for even numbers: a(n) = floor(n^(2/3)) and for odd n: a(n) = floor(n^(3/2)) = floor(sqrt(n^3)).
- Modified juggler map: see A095396. Largest value in trajectory of started n under the juggler map of A095396.A095397
Modified juggler map: see A095396. Largest value in trajectory of started n under the juggler map of A095396.
- Number of steps required to reach 1 for iterated modified juggler map of A095396.A095398
Number of steps required to reach 1 for iterated modified juggler map of A095396.
- Modified juggler modified further: a[n]=(1-Mod[n,2])*Floor[n^(3/4)]+Mod[n,2]*Floor[n^(4/3)]; original exponents {1/2,3/2} are replaced with {3/4,4/3}.A095399
Modified juggler modified further: a[n]=(1-Mod[n,2])*Floor[n^(3/4)]+Mod[n,2]*Floor[n^(4/3)]; original exponents {1/2,3/2} are replaced with {3/4,4/3}.
- Largest value in trajectory when the following modified juggler map is iterated: a[n]=(1-Mod[n, 2])*Floor[n^(3/4)]+Mod[n, 2]*Floor[n^(4/3)]; original exponents {1/2, 3/2} are replaced with {3/4, 4/3}.A095400
Largest value in trajectory when the following modified juggler map is iterated: a[n]=(1-Mod[n, 2])*Floor[n^(3/4)]+Mod[n, 2]*Floor[n^(4/3)]; original exponents {1/2, 3/2} are replaced with {3/4, 4/3}.
- number of steps required to reach 1 if the following modified juggler map is iterated: a[n]=(1-Mod[n, 2])*Floor[n^(3/4)]+Mod[n, 2]*Floor[n^(4/3)]; original exponents {1/2, 3/2} are replaced with {3/4, 4/3}.A095401
number of steps required to reach 1 if the following modified juggler map is iterated: a[n]=(1-Mod[n, 2])*Floor[n^(3/4)]+Mod[n, 2]*Floor[n^(4/3)]; original exponents {1/2, 3/2} are replaced with {3/4, 4/3}.
- Sum of digits of all distinct prime factors of n.A095402
Sum of digits of all distinct prime factors of n.
- Sum of digits of n minus the sum of digits of all distinct prime factors of n.A095403
Sum of digits of n minus the sum of digits of all distinct prime factors of n.
- Numbers n such that Sum-of-digits-of-n > Sum-of-digits-of-all-distinct-prime-factors-of-n.A095404
Numbers n such that Sum-of-digits-of-n > Sum-of-digits-of-all-distinct-prime-factors-of-n.
- Numbers n such that Sum-of-digits-of-n = Sum-of-digits-of-all-distinct-prime-factors-of-n.A095405
Numbers n such that Sum-of-digits-of-n = Sum-of-digits-of-all-distinct-prime-factors-of-n.
- Numbers n such that Sum-of-digits-of-n < Sum-of-digits-of-all-distinct-prime-factors-of-n.A095406
Numbers n such that Sum-of-digits-of-n < Sum-of-digits-of-all-distinct-prime-factors-of-n.
- Total number of decimal digits of all distinct prime factors of n.A095407
Total number of decimal digits of all distinct prime factors of n.
- Total number of decimal digits in all distinct prime factors of n minus number of digits in n.A095408
Total number of decimal digits in all distinct prime factors of n minus number of digits in n.
- Numbers k such that total number of decimal digits of all distinct prime factors of k is smaller than number of digits of k.A095409
Numbers k such that total number of decimal digits of all distinct prime factors of k is smaller than number of digits of k.
- Numbers n such that total number of decimal digits of all distinct prime factors of n equals the number of digits of n.A095410
Numbers n such that total number of decimal digits of all distinct prime factors of n equals the number of digits of n.