Sequences
392,541 sequences
- Let f(n) = lcd(n)-lpf(n), where lcd(n) is the largest common difference between consecutive divisors of n (ordered by size) and lpf(n) is the largest prime factor of n. Sequence gives number of iterations for f(n) to reach 0 or -1.A075661
Let f(n) = lcd(n)-lpf(n), where lcd(n) is the largest common difference between consecutive divisors of n (ordered by size) and lpf(n) is the largest prime factor of n. Sequence gives number of iterations for f(n) to reach 0 or -1.
- Where records occur in A063574.A075662
Where records occur in A063574.
- Record high values in A063574.A075663
Record high values in A063574.
- Sum of next n cubes.A075664
Sum of next n cubes.
- Sum of next n 4th powers.A075665
Sum of next n 4th powers.
- Sum of next n 5th powers.A075666
Sum of next n 5th powers.
- Sum of next n 6th powers.A075667
Sum of next n 6th powers.
- Sum of next n 7th powers.A075668
Sum of next n 7th powers.
- Sum of next n 8th powers.A075669
Sum of next n 8th powers.
- Sum of next n 9th powers.A075670
Sum of next n 9th powers.
- Sum of next n 10th powers.A075671
Sum of next n 10th powers.
- Duplicate of A069876.A075672
Duplicate of A069876.
- Sum of next n integer interprimes (cf. A024675).A075673
Sum of next n integer interprimes (cf. A024675).
- Sum of next n odd interprimes.A075674
Sum of next n odd interprimes.
- Sum of next n even interprimes.A075675
Sum of next n even interprimes.
- Sequences A001644 and A000073 interleaved.A075676
Sequences A001644 and A000073 interleaved.
- Reduced Collatz function R applied to the odd integers: a(n) = R(2n-1), where R(k) = (3k+1)/2^r, with r as large as possible.A075677
Reduced Collatz function R applied to the odd integers: a(n) = R(2n-1), where R(k) = (3k+1)/2^r, with r as large as possible.
- Number of fixed (orientation matters) polyominoids (shapes made of faces of cubes) with n squares.A075678
Number of fixed (orientation matters) polyominoids (shapes made of faces of cubes) with n squares.
- Number of free (rotations and reflections count as same shape) polyominoids (shapes made of faces of cubes) with n squares.A075679
Number of free (rotations and reflections count as same shape) polyominoids (shapes made of faces of cubes) with n squares.
- For odd numbers 2n-1, the minimum number of iterations of the reduced Collatz function R required to yield 1. The function R is defined as R(k) = (3k+1)/2^r, with r as large as possible.A075680
For odd numbers 2n-1, the minimum number of iterations of the reduced Collatz function R required to yield 1. The function R is defined as R(k) = (3k+1)/2^r, with r as large as possible.
- a(n) = (n-1)*(n-2)^3 - A003878(n-3), with a(1) = a(2) = 0 and a(3) = 2.A075681
a(n) = (n-1)*(n-2)^3 - A003878(n-3), with a(1) = a(2) = 0 and a(3) = 2.
- First differences of A075681.A075682
First differences of A075681.
- 2nd differences of A075681.A075683
2nd differences of A075681.
- For odd numbers 2n-1, the maximum number produced by iterating the reduced Collatz function R defined as R(k) = (3k+1)/2^r, with r as large as possible.A075684
For odd numbers 2n-1, the maximum number produced by iterating the reduced Collatz function R defined as R(k) = (3k+1)/2^r, with r as large as possible.
- Reverse and Add! carried out in base 4; number of steps needed to reach a palindrome, or -1 if no palindrome is ever reached.A075685
Reverse and Add! carried out in base 4; number of steps needed to reach a palindrome, or -1 if no palindrome is ever reached.
- In base 4, n sets a new record for the number of Reverse and Add! steps needed to reach a palindrome starting with n.A075686
In base 4, n sets a new record for the number of Reverse and Add! steps needed to reach a palindrome starting with n.
- In base 4, records for the number of Reverse and Add! steps needed to reach a palindrome.A075687
In base 4, records for the number of Reverse and Add! steps needed to reach a palindrome.
- Pair sums are even interprimes.A075688
Pair sums are even interprimes.
- Even interprimes from A075688.A075689
Even interprimes from A075688.
- a(n) = (n-1)*(n-2)^4 - A028294(n), for n > 4, with a(1) = a(2) = 0, a(3) = 2, and a(4) = 48.A075690
a(n) = (n-1)*(n-2)^4 - A028294(n), for n > 4, with a(1) = a(2) = 0, a(3) = 2, and a(4) = 48.
- Let M(k) be the k X k matrix m_(i,j) = i (mod j) - j (mod i); then a(n) = det(M(2*n)).A075691
Let M(k) be the k X k matrix m_(i,j) = i (mod j) - j (mod i); then a(n) = det(M(2*n)).
- Upper irredundance number for queens graph Q_n on n^2 nodes.A075692
Upper irredundance number for queens graph Q_n on n^2 nodes.
- Difference between 10-adic numbers defined in A018248 & A018247.A075693
Difference between 10-adic numbers defined in A018248 & A018247.
- a(1)=1, then "jump over next prime": a(n) = 2 nextprime(a(n-1))-a(n-1).A075694
a(1)=1, then "jump over next prime": a(n) = 2 nextprime(a(n-1))-a(n-1).
- a(1)=1, then "jump over two primes": a(n) = 2*nextprime(nextprime(a(n-1))) - a(n-1).A075695
a(1)=1, then "jump over two primes": a(n) = 2*nextprime(nextprime(a(n-1))) - a(n-1).
- Sum-of-digits of k appears somewhere in prime(k).A075696
Sum-of-digits of k appears somewhere in prime(k).
- a(n) = sum-of-digits(A075696(n)).A075697
a(n) = sum-of-digits(A075696(n)).
- Primes of index m from A075696, a(n) = prime(A075696(n)).A075698
Primes of index m from A075696, a(n) = prime(A075696(n)).
- Number of primes in the interval (n,4n].A075699
Number of primes in the interval (n,4n].
- Decimal expansion of -zeta'(0).A075700
Decimal expansion of -zeta'(0).
- a(1)=1, a(n+1)=sigma(a(n))-2*a(n).A075701
a(1)=1, a(n+1)=sigma(a(n))-2*a(n).
- Numbers k such that the k-th prime divides the k-th Fibonacci number.A075702
Numbers k such that the k-th prime divides the k-th Fibonacci number.
- a(n) = maximal m such that Sum_{k=n..m} prime(k) <= prime(n)*prime(m).A075703
a(n) = maximal m such that Sum_{k=n..m} prime(k) <= prime(n)*prime(m).
- p and 12*p+1 are both primes.A075704
p and 12*p+1 are both primes.
- Safe primes (A005385) (p and (p-1)/2 are primes) such that 6*p+1 is also prime.A075705
Safe primes (A005385) (p and (p-1)/2 are primes) such that 6*p+1 is also prime.
- Safe primes (A005385) (p and (p-1)/2 are primes) such that 8*p+1 (A023228) is also prime.A075706
Safe primes (A005385) (p and (p-1)/2 are primes) such that 8*p+1 (A023228) is also prime.
- Safe primes (A005385) (p and (p-1)/2 are primes) such that 12*p+1 is also prime.A075707
Safe primes (A005385) (p and (p-1)/2 are primes) such that 12*p+1 is also prime.
- Sum of the divisors of 2^n - 1.A075708
Sum of the divisors of 2^n - 1.
- Upper irredundance number for kings graph K_n on n^2 nodes.A075709
Upper irredundance number for kings graph K_n on n^2 nodes.
- Numerator of Sum_{k=1..n} frac(n/k), where frac(x/y) denotes the fractional part of x/y.A075710
Numerator of Sum_{k=1..n} frac(n/k), where frac(x/y) denotes the fractional part of x/y.