Sequences
392,541 sequences
- If n is semiprime (or 2-almost prime) then 1 else 0.A064911
If n is semiprime (or 2-almost prime) then 1 else 0.
- Period of continued fraction for sqrt(17)*n.A064912
Period of continued fraction for sqrt(17)*n.
- Period of continued fraction for sqrt(19)*n.A064913
Period of continued fraction for sqrt(19)*n.
- Number of ordered biquanimous partitions of 2n.A064914
Number of ordered biquanimous partitions of 2n.
- Positive integers n that are not of the form p + q * a^2, where p and q are primes and a is the smallest prime not dividing n.A064915
Positive integers n that are not of the form p + q * a^2, where p and q are primes and a is the smallest prime not dividing n.
- a(n) = n/lpf(n) + lpf(n) - 1, where lpf = A020639 = least prime factor.A064916
a(n) = n/lpf(n) + lpf(n) - 1, where lpf = A020639 = least prime factor.
- a(n) is the result of beginning with n and iterating k -> A064916(k) until a prime is reached.A064917
a(n) is the result of beginning with n and iterating k -> A064916(k) until a prime is reached.
- a(n) is the number of iterations of k -> A064916(k) to reach a prime, starting at n.A064918
a(n) is the number of iterations of k -> A064916(k) to reach a prime, starting at n.
- a(n) = Min { k | A064916(k) = n }.A064919
a(n) = Min { k | A064916(k) = n }.
- a(n) = n/gpf(n) + gpf(n) - 1, where gpf = A006530 = greatest prime factor.A064920
a(n) = n/gpf(n) + gpf(n) - 1, where gpf = A006530 = greatest prime factor.
- Iterate A064920 until a prime is reached.A064921
Iterate A064920 until a prime is reached.
- Number of iterations in A064920 to reach a prime.A064922
Number of iterations in A064920 to reach a prime.
- a(n) = Min { k | A064920(k) = n }.A064923
a(n) = Min { k | A064920(k) = n }.
- If n is prime then a(n) = n; for the subsequent nonprime positions a(n + k) = (k+1)*n; then at the next prime position a new subsequence begins.A064924
If n is prime then a(n) = n; for the subsequent nonprime positions a(n + k) = (k+1)*n; then at the next prime position a new subsequence begins.
- Period of continued fraction for sqrt(21)*n.A064925
Period of continued fraction for sqrt(21)*n.
- Period of continued fraction for sqrt(22)*n.A064926
Period of continued fraction for sqrt(22)*n.
- Period of continued fraction for sqrt(23)*n.A064927
Period of continued fraction for sqrt(23)*n.
- Inverse of A034175 considered as a permutation of the nonnegative integers (which it is conjectured to be).A064928
Inverse of A034175 considered as a permutation of the nonnegative integers (which it is conjectured to be).
- Square of A034175 considered as a permutation of the nonnegative integers (which it is conjectured to be).A064929
Square of A034175 considered as a permutation of the nonnegative integers (which it is conjectured to be).
- Inverse square of A034175 considered as a permutation of the nonnegative integers (which it is conjectured to be).A064930
Inverse square of A034175 considered as a permutation of the nonnegative integers (which it is conjectured to be).
- Numbers m such that the digits of m are also digits of m^3.A064931
Numbers m such that the digits of m are also digits of m^3.
- Period of the continued fraction for sqrt(3^(2n+1)).A064932
Period of the continued fraction for sqrt(3^(2n+1)).
- Numbers k such that the period of the continued fraction for sqrt(3)*k is 2.A064933
Numbers k such that the period of the continued fraction for sqrt(3)*k is 2.
- Smallest prime (or noncomposite) strictly greater than sum of previous terms (with a(0)=1).A064934
Smallest prime (or noncomposite) strictly greater than sum of previous terms (with a(0)=1).
- Numbers k such that (k+3)^(k+2) mod (k+1) = k.A064935
Numbers k such that (k+3)^(k+2) mod (k+1) = k.
- Primes p such that gcd(p, prime(p)^2 - 1) does not equal 1.A064936
Primes p such that gcd(p, prime(p)^2 - 1) does not equal 1.
- Nonprimes k such that gcd(k, prime(k)^2 - 1) is 1.A064937
Nonprimes k such that gcd(k, prime(k)^2 - 1) is 1.
- Nonprimes k such that k divides prime(k)^2 - 1.A064938
Nonprimes k such that k divides prime(k)^2 - 1.
- a(n) = Sum_{i=1..omega(n)} i*p_i, where {p_i}, i=1..omega(n) is the increasing sequence of prime divisors of n, where omega is the number of distinct prime factors of n (A001221).A064939
a(n) = Sum_{i=1..omega(n)} i*p_i, where {p_i}, i=1..omega(n) is the increasing sequence of prime divisors of n, where omega is the number of distinct prime factors of n (A001221).
- Values of k for which A065358(k) is 0.A064940
Values of k for which A065358(k) is 0.
- Quartering a 2n X 2n chessboard (reference A257952) considering only the 90-deg rotationally symmetric results (omitting results with only 180-deg symmetry).A064941
Quartering a 2n X 2n chessboard (reference A257952) considering only the 90-deg rotationally symmetric results (omitting results with only 180-deg symmetry).
- Decimal numbers n such that after possibly prefixing leading 0's to n, the resulting number n' can be broken into 2 numbers of equal length, n' = xy, such that x^2+y^2 = n (y may also have leading zeros).A064942
Decimal numbers n such that after possibly prefixing leading 0's to n, the resulting number n' can be broken into 2 numbers of equal length, n' = xy, such that x^2+y^2 = n (y may also have leading zeros).
- Number of integers with 2*n digits that are the sum of the squares of their halves (leading zeros count; 1 does not, to avoid the ambiguity 1 = 0^2 + 1^2 = 00^2 + 01^2 = 000^2 + 001^2 = ...).A064943
Number of integers with 2*n digits that are the sum of the squares of their halves (leading zeros count; 1 does not, to avoid the ambiguity 1 = 0^2 + 1^2 = 00^2 + 01^2 = 000^2 + 001^2 = ...).
- a(n) = Sum_{i|n, j|n, j >= i} j.A064944
a(n) = Sum_{i|n, j|n, j >= i} j.
- a(n) = Sum_{i|n, j|n, j >= i} i.A064945
a(n) = Sum_{i|n, j|n, j >= i} i.
- a(n) = Sum_{i|n, j|n, j>i} j.A064946
a(n) = Sum_{i|n, j|n, j>i} j.
- a(n) = Sum_{i|n, j|n, j>i} i.A064947
a(n) = Sum_{i|n, j|n, j>i} i.
- a(n) = Sum_{i|n, j|n} max(i,j).A064948
a(n) = Sum_{i|n, j|n} max(i,j).
- a(n) = Sum_{i|n, j|n} min(i,j).A064949
a(n) = Sum_{i|n, j|n} min(i,j).
- a(n) = Sum_{i|n, j|n} lcm(i,j).A064950
a(n) = Sum_{i|n, j|n} lcm(i,j).
- a(n) = Sum_{1 <= x, y <= n} lcm(x, y).A064951
a(n) = Sum_{1 <= x, y <= n} lcm(x, y).
- Number of odd terms among first n terms of A064413.A064952
Number of odd terms among first n terms of A064413.
- Where the even terms appear in A064413.A064953
Where the even terms appear in A064413.
- Positions of powers of 2 in A064413.A064954
Positions of powers of 2 in A064413.
- Position of n-th prime in A064413.A064955
Position of n-th prime in A064413.
- Inverse permutation to A064417.A064956
Inverse permutation to A064417.
- Where the odd terms appear in A064413.A064957
Where the odd terms appear in A064413.
- Inverse permutation to A064418.A064958
Inverse permutation to A064418.
- Inverse permutation to A064419.A064959
Inverse permutation to A064419.
- The prime then composite recurrence; a(2n) = a(2n-1)-th prime and a(2n+1) = a(2n)-th composite and a(1) = 1.A064960
The prime then composite recurrence; a(2n) = a(2n-1)-th prime and a(2n+1) = a(2n)-th composite and a(1) = 1.