Sequences
392,541 sequences
- Numerator of the sum of the ratios of consecutive primes.A094661
Numerator of the sum of the ratios of consecutive primes.
- Prime numerators of the sums of the ratios of consecutive primes.A094662
Prime numerators of the sums of the ratios of consecutive primes.
- Prime numerators of the sums of the ratios of consecutive primes.A094663
Prime numerators of the sums of the ratios of consecutive primes.
- Row sums of triangle A094344.A094664
Row sums of triangle A094344.
- Another version of triangular array in A083061: triangle T(n,k), 0<=k<=n, read by rows; given by [0, 1, 3, 6, 10, 15, 21, 28, ...] DELTA [1, 2, 3, 4, 5, 6, 7, 8, ...] where DELTA is the operator defined in A084938.A094665
Another version of triangular array in A083061: triangle T(n,k), 0<=k<=n, read by rows; given by [0, 1, 3, 6, 10, 15, 21, 28, ...] DELTA [1, 2, 3, 4, 5, 6, 7, 8, ...] where DELTA is the operator defined in A084938.
- Composite NSW numbers.A094666
Composite NSW numbers.
- Number of (s(0), s(1), ..., s(2n+1)) such that 0 < s(i) < 10 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n+1, s(0) = 1, s(2n+1) = 4.A094667
Number of (s(0), s(1), ..., s(2n+1)) such that 0 < s(i) < 10 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n+1, s(0) = 1, s(2n+1) = 4.
- a(n+1) = smallest prime p>a(n) such that p-a(k) is not a prime power for all k<=n; a(1)=2.A094668
a(n+1) = smallest prime p>a(n) such that p-a(k) is not a prime power for all k<=n; a(1)=2.
- Number of halving and tripling steps for 10^n to reach 1 in '3x+1' problem.A094669
Number of halving and tripling steps for 10^n to reach 1 in '3x+1' problem.
- Smallest number which requires n iterations to reach 1 in the juggler sequence problem.A094670
Smallest number which requires n iterations to reach 1 in the juggler sequence problem.
- a(n) = abs( Re( floor( -(Pi - 2*n*Pi*Log(n) + sqrt(Pi*n*(4*i*n + 8*Pi)) ) / (2*Pi) ) ) ), where i = sqrt(-1).A094671
a(n) = abs( Re( floor( -(Pi - 2*n*Pi*Log(n) + sqrt(Pi*n*(4*i*n + 8*Pi)) ) / (2*Pi) ) ) ), where i = sqrt(-1).
- Values of n such that one or more ending terms of the lexicographically earliest squarefree ternary word (LMSFTW) of length n differ(s) from the first n terms of the LMSFTW of length n+1.A094672
Values of n such that one or more ending terms of the lexicographically earliest squarefree ternary word (LMSFTW) of length n differ(s) from the first n terms of the LMSFTW of length n+1.
- Number of final terms of the LMSFTW of length m that differ from the first m terms of the LMSFTW of length m+1, where m is the n-th term of A094672.A094673
Number of final terms of the LMSFTW of length m that differ from the first m terms of the LMSFTW of length m+1, where m is the n-th term of A094672.
- Coefficients of polynomial in x multiplying sinh(x) in the modified spherical Bessel function of the first kind i_n(x).A094674
Coefficients of polynomial in x multiplying sinh(x) in the modified spherical Bessel function of the first kind i_n(x).
- Coefficients of polynomial in x multiplying cosh(x) in the modified spherical Bessel function of the first kind i_n(x).A094675
Coefficients of polynomial in x multiplying cosh(x) in the modified spherical Bessel function of the first kind i_n(x).
- a(n) = least number m such that the quotient m/n is obtained merely by shifting the leftmost digit of m to the right end and the second digit of m is not zero.A094676
a(n) = least number m such that the quotient m/n is obtained merely by shifting the leftmost digit of m to the right end and the second digit of m is not zero.
- Sum of digits is divisible by 10.A094677
Sum of digits is divisible by 10.
- a(n) = A003474(n)/n.A094678
a(n) = A003474(n)/n.
- n sets a new record for number of iterations to reach 1 in the juggler sequence problem.A094679
n sets a new record for number of iterations to reach 1 in the juggler sequence problem.
- a(n+1) = 4*a(n)^3 - 3*a(n), with a(0) = 2.A094680
a(n+1) = 4*a(n)^3 - 3*a(n), with a(0) = 2.
- Smallest number <>n, not occurring earlier and having as many distinct prime factors as n has, with a(1) = 1.A094681
Smallest number <>n, not occurring earlier and having as many distinct prime factors as n has, with a(1) = 1.
- Discriminants of integer positive ternary quadratic forms that are spinor regular but not regular.A094682
Discriminants of integer positive ternary quadratic forms that are spinor regular but not regular.
- Juggler sequence: if n mod 2 = 0 then floor(sqrt(n)) else floor(n^(3/2)).A094683
Juggler sequence: if n mod 2 = 0 then floor(sqrt(n)) else floor(n^(3/2)).
- Records in A094683.A094684
Records in A094683.
- Modified juggler sequence: if n mod 2 = 0 then round(sqrt(n)) else round(n^(3/2)).A094685
Modified juggler sequence: if n mod 2 = 0 then round(sqrt(n)) else round(n^(3/2)).
- A Fibonacci convolution.A094686
A Fibonacci convolution.
- Convolution of Fibonacci and Jacobsthal numbers.A094687
Convolution of Fibonacci and Jacobsthal numbers.
- Convolution of Fibonacci(n) and 3^n.A094688
Convolution of Fibonacci(n) and 3^n.
- Decimal expansion of (1+(1+(1+...)^(1/e))^(1/e))^(1/e).A094689
Decimal expansion of (1+(1+(1+...)^(1/e))^(1/e))^(1/e).
- Continued fraction expansion of (1+(1+(1+...)^(1/e))^(1/e))^(1/e).A094690
Continued fraction expansion of (1+(1+(1+...)^(1/e))^(1/e))^(1/e).
- Decimal expansion of -Integral_{x=0..1} (sqrt(x)/log(1-x)) dx.A094691
Decimal expansion of -Integral_{x=0..1} (sqrt(x)/log(1-x)) dx.
- Decimal expansion of 2^(5/4)*sqrt(Pi)*exp(Pi/8)/Gamma(1/4)^2.A094692
Decimal expansion of 2^(5/4)*sqrt(Pi)*exp(Pi/8)/Gamma(1/4)^2.
- Records in A094685.A094693
Records in A094685.
- Numbers having in binary representation more 1s than their squares.A094694
Numbers having in binary representation more 1s than their squares.
- Numbers having in binary representation fewer ones than in their squares.A094695
Numbers having in binary representation fewer ones than in their squares.
- Records in A007321.A094696
Records in A007321.
- Where records occur in A007321.A094697
Where records occur in A007321.
- Number of steps where the Juggler sequence reaches a new record.A094698
Number of steps where the Juggler sequence reaches a new record.
- Number of prime partition numbers <= n-th partition number.A094699
Number of prime partition numbers <= n-th partition number.
- Number of partition numbers that are smaller than and coprime to the n-th partition number.A094700
Number of partition numbers that are smaller than and coprime to the n-th partition number.
- Smallest linear combination of phi(n) and sigma(n) with nonnegative coefficients: a(n) = Min_{x>=0,y>=0} (x+y) for which x*phi(n) + y*sigma(n) is a multiple of n.A094701
Smallest linear combination of phi(n) and sigma(n) with nonnegative coefficients: a(n) = Min_{x>=0,y>=0} (x+y) for which x*phi(n) + y*sigma(n) is a multiple of n.
- Least linear combinations of phi(n) and sigma(n) are multiple.A094702
Least linear combinations of phi(n) and sigma(n) are multiple.
- a(n) = 8*a(n-1) + 21*a(n-2), with a(1)=1, a(2)=11.A094703
a(n) = 8*a(n-1) + 21*a(n-2), with a(1)=1, a(2)=11.
- Convolution of Fibonacci(n) and 10^n.A094704
Convolution of Fibonacci(n) and 10^n.
- Convolution of Jacobsthal(n) and 3^n.A094705
Convolution of Jacobsthal(n) and 3^n.
- Convolution of Pell(n) and 2^n.A094706
Convolution of Pell(n) and 2^n.
- Partial sums of repeated Fibonacci sequence.A094707
Partial sums of repeated Fibonacci sequence.
- Size of the smallest set hitting all {x, 2x, 3x} contained in D(n) = the first n 3-smooth numbers {1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 27,...} (A003586).A094708
Size of the smallest set hitting all {x, 2x, 3x} contained in D(n) = the first n 3-smooth numbers {1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 27,...} (A003586).
- Smallest k such that prime(n)# - k and prime(n)# + k are primes, where prime(n)# = A002110(n).A094709
Smallest k such that prime(n)# - k and prime(n)# + k are primes, where prime(n)# = A002110(n).
- Smaller of a pair (p,q) of primes with (p+q)/2=prime(n)# and q-p is minimal.A094710
Smaller of a pair (p,q) of primes with (p+q)/2=prime(n)# and q-p is minimal.