Sequences
392,541 sequences
- a(n) = sigma(n)^2.A072861
a(n) = sigma(n)^2.
- The smallest k>1 such that k divides sigma(k*n) is equal to 6.A072862
The smallest k>1 such that k divides sigma(k*n) is equal to 6.
- a(n) = 2^(n-3)*(n^2+3*n+8).A072863
a(n) = 2^(n-3)*(n^2+3*n+8).
- Numbers m such that the smallest k dividing sigma(k*m^2) is equal to 3.A072864
Numbers m such that the smallest k dividing sigma(k*m^2) is equal to 3.
- Smallest k > 1 dividing tau(k*n) (cf. A000005).A072865
Smallest k > 1 dividing tau(k*n) (cf. A000005).
- Smallest k > 1 dividing tau(k*2^n) (cf. A000005).A072866
Smallest k > 1 dividing tau(k*2^n) (cf. A000005).
- A Ramanujan congruence modulo 11^2 related to partition numbers: a(n) = p(121*n-5)/121 where p(k) is the k-th partition number.A072867
A Ramanujan congruence modulo 11^2 related to partition numbers: a(n) = p(121*n-5)/121 where p(k) is the k-th partition number.
- Numbers k such that sigma(sigma(k) - k) = k.A072868
Numbers k such that sigma(sigma(k) - k) = k.
- a(n) = sigma(sigma(n)-n), where sigma = A000203, sum of the divisors of n.A072869
a(n) = sigma(sigma(n)-n), where sigma = A000203, sum of the divisors of n.
- A Ramanujan congruence modulo 5^2 related to partition numbers: a(n) = p(25n+24)/25 where p(k) is the k-th partition number.A072870
A Ramanujan congruence modulo 5^2 related to partition numbers: a(n) = p(25n+24)/25 where p(k) is the k-th partition number.
- Smallest partition number divisible by n.A072871
Smallest partition number divisible by n.
- a(n) is the smallest positive number k such that n divides 2^k - k.A072872
a(n) is the smallest positive number k such that n divides 2^k - k.
- Numbers k such that Sum_i ( e(i)/p(i) ) is an integer, where the prime factorization of k is Product_i ( p(i)^e(i) ).A072873
Numbers k such that Sum_i ( e(i)/p(i) ) is an integer, where the prime factorization of k is Product_i ( p(i)^e(i) ).
- Numbers k such that A000213(k) == 1 (mod k).A072874
Numbers k such that A000213(k) == 1 (mod k).
- Smallest start for a run of n consecutive numbers of which the i-th has exactly i prime factors.A072875
Smallest start for a run of n consecutive numbers of which the i-th has exactly i prime factors.
- a(1) = a(2) = a(3) = a(4) = 1 and a(n) = (a(n-1)*a(n-3) + a(n-2)^3)/a(n-4) for n >= 5.A072876
a(1) = a(2) = a(3) = a(4) = 1 and a(n) = (a(n-1)*a(n-3) + a(n-2)^3)/a(n-4) for n >= 5.
- a(1) = a(2) = a(3) = a(4) = 1; a(n) = (a(n-1)*a(n-3) + a(n-2)^4)/a(n-4).A072877
a(1) = a(2) = a(3) = a(4) = 1; a(n) = (a(n-1)*a(n-3) + a(n-2)^4)/a(n-4).
- a(n) = 4*a(n-1)*a(n-2)*a(n-3) - a(n-4) with a(1) = a(2) = a(3) = a(4) = 1.A072878
a(n) = 4*a(n-1)*a(n-2)*a(n-3) - a(n-4) with a(1) = a(2) = a(3) = a(4) = 1.
- a(n) = 5*a(n-1)*a(n-2)*a(n-3)*a(n-4) - a(n-5) with a(1) = a(2) = a(3) = a(4) = a(5) = 1.A072879
a(n) = 5*a(n-1)*a(n-2)*a(n-3)*a(n-4) - a(n-5) with a(1) = a(2) = a(3) = a(4) = a(5) = 1.
- A recurrence of order 6: a(1)=a(2)=a(3)=a(4)=a(5)=a(6)=1; a(n) = (a(n-1)^2 + a(n-2)^2 + a(n-3)^2 + a(n-4)^2 + a(n-5)^2)/a(n-6).A072880
A recurrence of order 6: a(1)=a(2)=a(3)=a(4)=a(5)=a(6)=1; a(n) = (a(n-1)^2 + a(n-2)^2 + a(n-3)^2 + a(n-4)^2 + a(n-5)^2)/a(n-6).
- a(1)=a(2)=a(3)=1; for n>3, a(n)=(a(n-1)*a(n-2)+a(n-1)+a(n-2))/a(n-3).A072881
a(1)=a(2)=a(3)=1; for n>3, a(n)=(a(n-1)*a(n-2)+a(n-1)+a(n-2))/a(n-3).
- A nonlinear recurrence of order 3: a(1)=a(2)=a(3)=1; a(n)=(a(n-1)+a(n-2))^2/a(n-3).A072882
A nonlinear recurrence of order 3: a(1)=a(2)=a(3)=1; a(n)=(a(n-1)+a(n-2))^2/a(n-3).
- Least k >= 1 such that k^n + n is prime, or 0 if no such k exists.A072883
Least k >= 1 such that k^n + n is prime, or 0 if no such k exists.
- 3rd-order digital invariants: the sum of the cubes of the digits of n equals some number k and the sum of the cubes of the digits of k equals n.A072884
3rd-order digital invariants: the sum of the cubes of the digits of n equals some number k and the sum of the cubes of the digits of k equals n.
- Primes p with a prime number of digits in all base b with 1 <= b <= p.A072885
Primes p with a prime number of digits in all base b with 1 <= b <= p.
- The s-aints, numbers generated like the Aronson series from a generating sentence, "S ain't the second, third, fourth, fifth . . . letter of this sentence.".A072886
The s-aints, numbers generated like the Aronson series from a generating sentence, "S ain't the second, third, fourth, fifth . . . letter of this sentence.".
- The s-inners or non-s-aints, numbers generated like the Aronson series from the letters, specifically the s, in a generating sentence, "S ain't the second, third, fourth, fifth . . . letter of this sentence.".A072887
The s-inners or non-s-aints, numbers generated like the Aronson series from the letters, specifically the s, in a generating sentence, "S ain't the second, third, fourth, fifth . . . letter of this sentence.".
- Sum of the coefficients of the Schur function expansion of the square of the Vandermonde determinant in n variables.A072888
Sum of the coefficients of the Schur function expansion of the square of the Vandermonde determinant in n variables.
- Duplicate of A072884.A072889
Duplicate of A072884.
- The 28-cycle of the n => sigma(n)-n process, where sigma(n) is the sum of divisors of n (A000203).A072890
The 28-cycle of the n => sigma(n)-n process, where sigma(n) is the sum of divisors of n (A000203).
- The 5-cycle of the n => sigma(n)-n process, where sigma(n) is the sum of divisors of n (A000203).A072891
The 5-cycle of the n => sigma(n)-n process, where sigma(n) is the sum of divisors of n (A000203).
- The 4-cycle of the n => sigma(n)-n process. sigma(n) is the sum of divisors of n. (A000203).A072892
The 4-cycle of the n => sigma(n)-n process. sigma(n) is the sum of divisors of n. (A000203).
- Let c(k) be defined as follows: c(1)=1, c(2)=x, c(k+2) = c(k+1)/2 + c(k)/2 if c(k+1) and c(k) have the same parity; c(k+2) = c(k+1) - c(k) otherwise. Sequence gives values of x such that c(k)=1 for any k large enough.A072893
Let c(k) be defined as follows: c(1)=1, c(2)=x, c(k+2) = c(k+1)/2 + c(k)/2 if c(k+1) and c(k) have the same parity; c(k+2) = c(k+1) - c(k) otherwise. Sequence gives values of x such that c(k)=1 for any k large enough.
- Let c(k) be defined as follows: c(1)=1, c(2)=n, c(k+2) = c(k+1)/2 + c(k)/2 if c(k+1) and c(k) have the same parity; c(k+2) = c(k+1)/2 + c(k)/2 + 1/2 otherwise; a(n) = limit_{ k -> infinity} c(k).A072894
Let c(k) be defined as follows: c(1)=1, c(2)=n, c(k+2) = c(k+1)/2 + c(k)/2 if c(k+1) and c(k) have the same parity; c(k+2) = c(k+1)/2 + c(k)/2 + 1/2 otherwise; a(n) = limit_{ k -> infinity} c(k).
- Least k for the Theodorus spiral to complete n revolutions.A072895
Least k for the Theodorus spiral to complete n revolutions.
- 5th-order digital invariants: the sum of the 5th powers of the digits of n equals some number k and the sum of the 5th powers of the digits of k equals n.A072896
5th-order digital invariants: the sum of the 5th powers of the digits of n equals some number k and the sum of the 5th powers of the digits of k equals n.
- Least n-th order digital invariant which is not an Armstrong number (A005188), or 0 if no such term exists.A072897
Least n-th order digital invariant which is not an Armstrong number (A005188), or 0 if no such term exists.
- Numerator of c(n) where c(0)=1, c(n+1) = n/c(n) + 1.A072898
Numerator of c(n) where c(0)=1, c(n+1) = n/c(n) + 1.
- Denominator of c(n) where c(0)=1 c(n+1) = n/c(n) + 1.A072899
Denominator of c(n) where c(0)=1 c(n+1) = n/c(n) + 1.
- Discriminant of quadratic field Q(sqrt(prime(n))) where prime(n) is the n-th prime.A072900
Discriminant of quadratic field Q(sqrt(prime(n))) where prime(n) is the n-th prime.
- Composite numbers n such that the discriminant of the quadratic field Q(sqrt(n)) equals 4n.A072901
Composite numbers n such that the discriminant of the quadratic field Q(sqrt(n)) equals 4n.
- Nonprime numbers m such that the discriminant of the quadratic field Q(sqrt(m)) equals m.A072902
Nonprime numbers m such that the discriminant of the quadratic field Q(sqrt(m)) equals m.
- Numbers m such that the discriminant of the quadratic field Q(sqrt(m)) < m.A072903
Numbers m such that the discriminant of the quadratic field Q(sqrt(m)) < m.
- Nonsquares m such that the discriminant of the quadratic field Q(sqrt(m)) < m.A072904
Nonsquares m such that the discriminant of the quadratic field Q(sqrt(m)) < m.
- a(n) is the least k > n such that k*n is a square.A072905
a(n) is the least k > n such that k*n is a square.
- Least k >=1 such that floor(n/k) is squarefree.A072906
Least k >=1 such that floor(n/k) is squarefree.
- Decimal expansion of the solution of equation log(2) - X/8 - exp(-3X/7) = 0 (4.251844....).A072907
Decimal expansion of the solution of equation log(2) - X/8 - exp(-3X/7) = 0 (4.251844....).
- Decimal expansion of the solution of equation log(2)-X*2^(-r)-exp(-X*r/(2^r-1)) = 0 for r = 4 . Solution is 9.96955802...A072908
Decimal expansion of the solution of equation log(2)-X*2^(-r)-exp(-X*r/(2^r-1)) = 0 for r = 4 . Solution is 9.96955802...
- Least k>0 such that n+k is squarefree.A072909
Least k>0 such that n+k is squarefree.
- a(n) = sigma(A023883(n)) / tau(A023883(n)).A072910
a(n) = sigma(A023883(n)) / tau(A023883(n)).