Sequences
392,541 sequences
- Number of "phi-divisors" of n.A072911
Number of "phi-divisors" of n.
- Number of Fibonacci numbers F(k) <= 10^n which end in 0.A072912
Number of Fibonacci numbers F(k) <= 10^n which end in 0.
- Numerators of (1/4!)*(H(n,1)^4+6*H(n,1)^2*H(n,2)+8*H(n,1)*H(n,3)+3*H(n,2)^2+6*H(n,4)), where H(n,m) = Sum_{i=1..n} 1/i^m are generalized harmonic numbers.A072913
Numerators of (1/4!)*(H(n,1)^4+6*H(n,1)^2*H(n,2)+8*H(n,1)*H(n,3)+3*H(n,2)^2+6*H(n,4)), where H(n,m) = Sum_{i=1..n} 1/i^m are generalized harmonic numbers.
- Denominators of 1/4!*(H(n,1)^4+6*H(n,1)^2*H(n,2)+8*H(n,1)*H(n,3)+3*H(n,2)^2+6*H(n,4)), where H(n,m) = Sum_{i=1..n} 1/i^m are generalized harmonic numbers.A072914
Denominators of 1/4!*(H(n,1)^4+6*H(n,1)^2*H(n,2)+8*H(n,1)*H(n,3)+3*H(n,2)^2+6*H(n,4)), where H(n,m) = Sum_{i=1..n} 1/i^m are generalized harmonic numbers.
- Decimal expansion of the standard gravity acceleration (one "gee") in SI units.A072915
Decimal expansion of the standard gravity acceleration (one "gee") in SI units.
- Number of m such that floor(prime(m)/m) = n.A072916
Number of m such that floor(prime(m)/m) = n.
- a(n) = p(n) - phi(n), where p(n) is the least prime greater than phi(n).A072917
a(n) = p(n) - phi(n), where p(n) is the least prime greater than phi(n).
- a(n) = p(n) - sigma(n), where p(n) is the least prime greater than sigma(n).A072918
a(n) = p(n) - sigma(n), where p(n) is the least prime greater than sigma(n).
- a(n) = p(n) - binomial(2n,n), where p(n) is the least prime greater than binomial(2n,n).A072919
a(n) = p(n) - binomial(2n,n), where p(n) is the least prime greater than binomial(2n,n).
- a(n) = Sum_{k=1..n} A034693(k).A072920
a(n) = Sum_{k=1..n} A034693(k).
- a(1)=1; a(n) = a(n-1) + [sum of all decimal digits present so far in the sequence].A072921
a(1)=1; a(n) = a(n-1) + [sum of all decimal digits present so far in the sequence].
- Spell English name for n, then interpret as number in base 36.A072922
Spell English name for n, then interpret as number in base 36.
- Number of primes of the form floor( (1+1/k)^n ), 1<=k<=n.A072923
Number of primes of the form floor( (1+1/k)^n ), 1<=k<=n.
- Least k such that floor((1+1/k)^n) is prime.A072924
Least k such that floor((1+1/k)^n) is prime.
- Probably an erroneous version of A002845.A072925
Probably an erroneous version of A002845.
- a(n) = Sum_{k=1..n} A051699(k).A072926
a(n) = Sum_{k=1..n} A051699(k).
- a(n) = minimum value of abs(n-phi(x)), x>0.A072927
a(n) = minimum value of abs(n-phi(x)), x>0.
- Let p_0(m) = the m-th prime number, p_[i+1](m) = p_i(p_i(m)); then a(n) = p_n(1).A072928
Let p_0(m) = the m-th prime number, p_[i+1](m) = p_i(p_i(m)); then a(n) = p_n(1).
- a(n) = Sum_{d dividing n} binomial(2d,d).A072929
a(n) = Sum_{d dividing n} binomial(2d,d).
- a(1)=1, a(2)=10, a(n) = floor(a(n-1)/phi) + floor(a(n-2)/phi) where phi is the golden ratio (1+sqrt(5))/2 (if a(2) < 10 a(k) converges to an integer value).A072930
a(1)=1, a(2)=10, a(n) = floor(a(n-1)/phi) + floor(a(n-2)/phi) where phi is the golden ratio (1+sqrt(5))/2 (if a(2) < 10 a(k) converges to an integer value).
- Number of ways to write n as a sum of 2 semiprimes.A072931
Number of ways to write n as a sum of 2 semiprimes.
- a(n) is the least k such that floor( (1+1/k)^n ) = floor( (1+1/n)^k ).A072932
a(n) is the least k such that floor( (1+1/k)^n ) = floor( (1+1/n)^k ).
- Numbers m such that the least k such that floor( (1+1/k)^m ) = floor( (1+1/m)^k ) is not equal to round(m*91/100).A072933
Numbers m such that the least k such that floor( (1+1/k)^m ) = floor( (1+1/m)^k ) is not equal to round(m*91/100).
- Length of longest non-crossing walk along vertices of n-dimensional hypercubes.A072934
Length of longest non-crossing walk along vertices of n-dimensional hypercubes.
- Duplicate of A072936.A072935
Duplicate of A072936.
- Primes p that do not divide 2^x+1 for any x>=1.A072936
Primes p that do not divide 2^x+1 for any x>=1.
- Least k such that prime(n) appears in factorization of k! + 1.A072937
Least k such that prime(n) appears in factorization of k! + 1.
- Highly composite numbers that are half of the next highly composite number.A072938
Highly composite numbers that are half of the next highly composite number.
- Define a sequence c depending on n as follows: c(1)=1 and c(2)=n; c(k+2) = (c(k+1) + c(k))/2 if c(k+1) and c(k) have the same parity; otherwise c(k+2) = abs(c(k+1) - 2*c(k)); sequence gives values of n such that lim_{k->oo} c(k) = infinity.A072939
Define a sequence c depending on n as follows: c(1)=1 and c(2)=n; c(k+2) = (c(k+1) + c(k))/2 if c(k+1) and c(k) have the same parity; otherwise c(k+2) = abs(c(k+1) - 2*c(k)); sequence gives values of n such that lim_{k->oo} c(k) = infinity.
- Integers which have more than one coprime factorization into nonprime powers which sum to the same number.A072940
Integers which have more than one coprime factorization into nonprime powers which sum to the same number.
- Least multiple of n having no prime gaps.A072941
Least multiple of n having no prime gaps.
- a(n) is the least x such that the cyclotomic polynomial values Phi(d,x) are prime for all d dividing n.A072942
a(n) is the least x such that the cyclotomic polynomial values Phi(d,x) are prime for all d dividing n.
- Least nonnegative integer k such that n + k^3 is prime, or -1 if no such k exists.A072943
Least nonnegative integer k such that n + k^3 is prime, or -1 if no such k exists.
- a(1)=2, a(n+1) = 2*a(n) - phi(a(n)) where phi is the Euler totient function A000010.A072944
a(1)=2, a(n+1) = 2*a(n) - phi(a(n)) where phi is the Euler totient function A000010.
- Number of pairs (x,y) with x,y >= 0 such that x^3+y^2+x*y <= n.A072945
Number of pairs (x,y) with x,y >= 0 such that x^3+y^2+x*y <= n.
- Coefficient of the highest power of q in the expansion of nu(0)=1, nu(1)=b and for n>=2, nu(n)=b*nu(n-1)+lambda*(n-1)_q*nu(n-2) with (b,lambda)=(2,2), where (n)_q=(1+q+...+q^(n-1)) and q is a root of unity.A072946
Coefficient of the highest power of q in the expansion of nu(0)=1, nu(1)=b and for n>=2, nu(n)=b*nu(n-1)+lambda*(n-1)_q*nu(n-2) with (b,lambda)=(2,2), where (n)_q=(1+q+...+q^(n-1)) and q is a root of unity.
- Primes in A053065.A072947
Primes in A053065.
- Number of permutations p of {1,2,3,...,2n} such that Sum_{k=1..2n} abs(k-p(k)) = 2n.A072948
Number of permutations p of {1,2,3,...,2n} such that Sum_{k=1..2n} abs(k-p(k)) = 2n.
- Number of permutations p of {1,2,3,...,n} such that Sum_{k=1..n} abs(k-p(k)) = 2n.A072949
Number of permutations p of {1,2,3,...,n} such that Sum_{k=1..n} abs(k-p(k)) = 2n.
- Number of permutations p of (1,2,3,...,n) such that at least one value of abs(k-p(k)) is prime.A072950
Number of permutations p of (1,2,3,...,n) such that at least one value of abs(k-p(k)) is prime.
- a(n) = Sum_{k=1..n} binomial(k, n mod k).A072951
a(n) = Sum_{k=1..n} binomial(k, n mod k).
- Primes obtained as initial segments of the decimal expansion of the Euler-Mascheroni constant gamma = 0.5772... .A072952
Primes obtained as initial segments of the decimal expansion of the Euler-Mascheroni constant gamma = 0.5772... .
- a(n)=sum(k=1,n,C(n,n reduced (mod k))).A072953
a(n)=sum(k=1,n,C(n,n reduced (mod k))).
- Numbers n without letters a, i, l or t.A072954
Numbers n without letters a, i, l or t.
- Suburban numbers: without b, r, s or u.A072955
Suburban numbers: without b, r, s or u.
- Turban numbers: without letters r, t, or u.A072956
Turban numbers: without letters r, t, or u.
- Urban numbers: without 'r' or 'u'.A072957
Urban numbers: without 'r' or 'u'.
- Caliban numbers: without letters a, c, i, or l.A072958
Caliban numbers: without letters a, c, i, or l.
- Using the US English names for the nonnegative integers, assign each letter a numerical value as in A073327 (A=1, B=2, ..., Z=26), treat the name as a base-27 integer, and convert to decimal.A072959
Using the US English names for the nonnegative integers, assign each letter a numerical value as in A073327 (A=1, B=2, ..., Z=26), treat the name as a base-27 integer, and convert to decimal.
- Numbers using only the curved digits 0, 3, 6, 8 and 9.A072960
Numbers using only the curved digits 0, 3, 6, 8 and 9.