Sequences
392,541 sequences
- If n = p_1^e_1 * ... * p_k^e_k, p_1 < ... < p_k primes, then a(n) = min{ p_i*e_i }.A081811
If n = p_1^e_1 * ... * p_k^e_k, p_1 < ... < p_k primes, then a(n) = min{ p_i*e_i }.
- If n = p_1^e_1 * ... * p_k^e_k, p_1 < ... < p_k primes, then a(n) = Max{ Max(p_i, e_i) }.A081812
If n = p_1^e_1 * ... * p_k^e_k, p_1 < ... < p_k primes, then a(n) = Max{ Max(p_i, e_i) }.
- Decimal expansion of atomic mass constant energy equivalent in MeV.A081813
Decimal expansion of atomic mass constant energy equivalent in MeV.
- Deuteron-electron mass ratio.A081814
Deuteron-electron mass ratio.
- Decimal expansion of electron charge to mass quotient (negated).A081815
Decimal expansion of electron charge to mass quotient (negated).
- Electron mass energy equivalent m_e*c^2.A081816
Electron mass energy equivalent m_e*c^2.
- Electron mass energy equivalent in MeV.A081817
Electron mass energy equivalent in MeV.
- Outdated duplicate of A003672.A081818
Outdated duplicate of A003672.
- Decimal expansion of Wien wavelength displacement law constant.A081819
Decimal expansion of Wien wavelength displacement law constant.
- Decimal expansion of the Stefan-Boltzmann constant sigma in the 2019 SI system in units Watt/(m^2*K^4).A081820
Decimal expansion of the Stefan-Boltzmann constant sigma in the 2019 SI system in units Watt/(m^2*K^4).
- Rydberg constant, in inverse meters.A081821
Rydberg constant, in inverse meters.
- Outdated value of A070064.A081822
Outdated value of A070064.
- Decimal expansion of the elementary charge e in coulombs (C).A081823
Decimal expansion of the elementary charge e in coulombs (C).
- Decimal expansion of conductance quantum in units of S.A081824
Decimal expansion of conductance quantum in units of S.
- Decimal expansion of atomic mass constant, in kg.A081825
Decimal expansion of atomic mass constant, in kg.
- Tau-electron mass ratio.A081826
Tau-electron mass ratio.
- Successive differences of Hofstadter Q-sequence.A081827
Successive differences of Hofstadter Q-sequence.
- Numbers n such that 2 successive terms of Hofstadter Q-sequence are the same.A081828
Numbers n such that 2 successive terms of Hofstadter Q-sequence are the same.
- Numbers k such that the k-th term of Hofstadter Q-sequence is > (k+1)-th term.A081829
Numbers k such that the k-th term of Hofstadter Q-sequence is > (k+1)-th term.
- Numbers k such that the k-th term of Hofstadter Q-sequence is < (k+1)-th term.A081830
Numbers k such that the k-th term of Hofstadter Q-sequence is < (k+1)-th term.
- a(1)=a(2)=1, a(n) = a(a(n - a(n-1))) + a(n - a(n-2)).A081831
a(1)=a(2)=1, a(n) = a(a(n - a(n-1))) + a(n - a(n-2)).
- a(1)=a(2)=1, a(n) = a(n+1-2*a(n-1)) + a(n-2*a(n-2)).A081832
a(1)=a(2)=1, a(n) = a(n+1-2*a(n-1)) + a(n-2*a(n-2)).
- a(n) is the smallest number that can be expressed as the product of three positive integers in n distinct ways, or 0 if no such number exists.A081833
a(n) is the smallest number that can be expressed as the product of three positive integers in n distinct ways, or 0 if no such number exists.
- a(1)=1, a(n)=a(n-1)+4 if n is already in the sequence, a(n)=a(n-1)+3 otherwise.A081834
a(1)=1, a(n)=a(n-1)+4 if n is already in the sequence, a(n)=a(n-1)+3 otherwise.
- a(1)=1, a(n) = a(n-1) + 5 if n is already in the sequence, a(n) = a(n-1) + 4 otherwise.A081835
a(1)=1, a(n) = a(n-1) + 5 if n is already in the sequence, a(n) = a(n-1) + 4 otherwise.
- Let z(n) be the golden ratio (phi) truncated to n decimal digits; sequence gives maximum element in the continued fraction for z(n).A081836
Let z(n) be the golden ratio (phi) truncated to n decimal digits; sequence gives maximum element in the continued fraction for z(n).
- Let z(n) be e = exp(1.0) = 2.7182.... truncated to n decimal digits after the decimal point; sequence gives maximum element in the continued fraction for z(n).A081837
Let z(n) be e = exp(1.0) = 2.7182.... truncated to n decimal digits after the decimal point; sequence gives maximum element in the continued fraction for z(n).
- Let z(n) be the golden ratio truncated to n decimal digits; sequence gives n such that the last element in the continued fraction for z(n) is 2.A081838
Let z(n) be the golden ratio truncated to n decimal digits; sequence gives n such that the last element in the continued fraction for z(n) is 2.
- a(1)=0, a(n)=a(n-1)+4 if n is already in the sequence, a(n)=a(n-1)+5 otherwise.A081839
a(1)=0, a(n)=a(n-1)+4 if n is already in the sequence, a(n)=a(n-1)+5 otherwise.
- a(1)=0, a(n)=a(n-1)+3 if n is already in the sequence, a(n)=a(n-1)+4 otherwise.A081840
a(1)=0, a(n)=a(n-1)+3 if n is already in the sequence, a(n)=a(n-1)+4 otherwise.
- a(1)=0, a(n)=a(n-1)+3 if n is already in the sequence, a(n)=a(n-1)+2 otherwise.A081841
a(1)=0, a(n)=a(n-1)+3 if n is already in the sequence, a(n)=a(n-1)+2 otherwise.
- a(1)=0, a(n)=a(n-1)+4 if n is already in the sequence, a(n)=a(n-1)+3 otherwise.A081842
a(1)=0, a(n)=a(n-1)+4 if n is already in the sequence, a(n)=a(n-1)+3 otherwise.
- a(1)=0, a(n)=a(n-1)+5 if n is already in the sequence, a(n)=a(n-1)+4 otherwise.A081843
a(1)=0, a(n)=a(n-1)+5 if n is already in the sequence, a(n)=a(n-1)+4 otherwise.
- Number of irreducible factors of x^(2n+1) - 1 over GF(2).A081844
Number of irreducible factors of x^(2n+1) - 1 over GF(2).
- Decimal expansion of Product_{k>=0} (1 + 1/2^k).A081845
Decimal expansion of Product_{k>=0} (1 + 1/2^k).
- Maximal element in the continued fraction for (1/n)*Sum_{k>=0} 1/2^(2^k).A081846
Maximal element in the continued fraction for (1/n)*Sum_{k>=0} 1/2^(2^k).
- a(1) = 1, a(n) = smallest positive number such that the concatenation of a(n-1) and a(n) is a triangular number not obtained earlier.A081847
a(1) = 1, a(n) = smallest positive number such that the concatenation of a(n-1) and a(n) is a triangular number not obtained earlier.
- Number of numbers whose base-3/2 expansion (see A024629) has n digits.A081848
Number of numbers whose base-3/2 expansion (see A024629) has n digits.
- Consider recurrence b(0) = (2n+1)/2, b(n) = b(0)*ceiling(b(n-1)); sequence gives first integer reached.A081849
Consider recurrence b(0) = (2n+1)/2, b(n) = b(0)*ceiling(b(n-1)); sequence gives first integer reached.
- Consider recurrence b(0) = (2n+1)/4, b(n) = b(0)*ceiling(b(n-1)); sequence gives number of steps to reach an integer (or -1 if no integer is ever reached).A081850
Consider recurrence b(0) = (2n+1)/4, b(n) = b(0)*ceiling(b(n-1)); sequence gives number of steps to reach an integer (or -1 if no integer is ever reached).
- Consider recurrence b(0) = (2n+1)/4, b(n) = b(0)*ceiling(b(n-1)); sequence gives first integer reached (or -1 if no integer is ever reached).A081851
Consider recurrence b(0) = (2n+1)/4, b(n) = b(0)*ceiling(b(n-1)); sequence gives first integer reached (or -1 if no integer is ever reached).
- Consider recurrence b(0) = n/3, b(n) = b(0)*ceiling(b(n-1)); sequence gives first integer reached (or -1 if no integer is ever reached).A081852
Consider recurrence b(0) = n/3, b(n) = b(0)*ceiling(b(n-1)); sequence gives first integer reached (or -1 if no integer is ever reached).
- Consider recurrence b(0) = (2n+1)/2, b(n) = b(n-1)*ceiling(b(n-1)); sequence gives first integer reached.A081853
Consider recurrence b(0) = (2n+1)/2, b(n) = b(n-1)*ceiling(b(n-1)); sequence gives first integer reached.
- a(n) = (8*n - 3)*(4*n - 1)*(8*n^2 - 5*n + 1).A081854
a(n) = (8*n - 3)*(4*n - 1)*(8*n^2 - 5*n + 1).
- Decimal expansion of Gamma''(1).A081855
Decimal expansion of Gamma''(1).
- Numbers k such that 2k-1 divides 2^k-1.A081856
Numbers k such that 2k-1 divides 2^k-1.
- Jacobsthal sequence (A001045) as represented in base 4.A081857
Jacobsthal sequence (A001045) as represented in base 4.
- Numbers k such that 2*k+1 divides 2^k-1.A081858
Numbers k such that 2*k+1 divides 2^k-1.
- Short leg of primitive Pythagorean triangles sorted on semiperimeter.A081859
Short leg of primitive Pythagorean triangles sorted on semiperimeter.
- a(n) = Sum_{k=0..n-1} sigma(2k+1)*sigma_3(n-k).A081860
a(n) = Sum_{k=0..n-1} sigma(2k+1)*sigma_3(n-k).