Sequences
392,541 sequences
- Numbers n such that no group of order n can be a central factor.A069161
Numbers n such that no group of order n can be a central factor.
- a(1)=1, a(2)=2, a(n+2)=(a(n+1)+a(n))/2 if a(n+1)+a(n) is even, a(n+2)=(3*(a(n+1)+a(n))+1)/2 otherwise.A069162
a(1)=1, a(2)=2, a(n+2)=(a(n+1)+a(n))/2 if a(n+1)+a(n) is even, a(n+2)=(3*(a(n+1)+a(n))+1)/2 otherwise.
- Number of symmetric primes between n^2 and (n+2)^2. Two primes are termed symmetric in n^2 to (n+2)^2 if there is a k < 2n such that mid-k and mid+k are both prime, where mid =n(n+2).A069163
Number of symmetric primes between n^2 and (n+2)^2. Two primes are termed symmetric in n^2 to (n+2)^2 if there is a k < 2n such that mid-k and mid+k are both prime, where mid =n(n+2).
- Numbers k such that k*Sum_{d|k} 1/tau(d) is an integer.A069164
Numbers k such that k*Sum_{d|k} 1/tau(d) is an integer.
- a(n) are the integers corresponding to A069164(n).A069165
a(n) are the integers corresponding to A069164(n).
- Numbers k such that k*Sum_{d|k} 1/sigma(d) is an integer.A069166
Numbers k such that k*Sum_{d|k} 1/sigma(d) is an integer.
- Numbers k such that k*Sum_{d|k} 1/phi(d) is an integer.A069167
Numbers k such that k*Sum_{d|k} 1/phi(d) is an integer.
- Numbers k such that sigma(k) * Sum_{d|k} (1/sigma(d)) is not an integer.A069168
Numbers k such that sigma(k) * Sum_{d|k} (1/sigma(d)) is not an integer.
- Nonprimes k such that sigma(k)*Sum_{d|k} 1/sigma(d) is an integer.A069169
Nonprimes k such that sigma(k)*Sum_{d|k} 1/sigma(d) is an integer.
- Values of phi(k)*Sum_{d|k} 1/phi(d) for nonprimes k.A069170
Values of phi(k)*Sum_{d|k} 1/phi(d) for nonprimes k.
- Numbers k such that gcd(k, 2^k-1) = 3.A069171
Numbers k such that gcd(k, 2^k-1) = 3.
- Smallest triangular number such that arithmetic mean of its digits = n (sum of the digits = n times the number of digits).A069172
Smallest triangular number such that arithmetic mean of its digits = n (sum of the digits = n times the number of digits).
- Centered 22-gonal numbers.A069173
Centered 22-gonal numbers.
- Centered 23-gonal numbers.A069174
Centered 23-gonal numbers.
- Numbers k such that k-1, k+1, 2*k-1, 2*k+1, 4*k-1 and 4*k+1 are all prime.A069175
Numbers k such that k-1, k+1, 2*k-1, 2*k+1, 4*k-1 and 4*k+1 are all prime.
- Numbers n such that n-1, n+1, 2n-1, 2n+1, 4n-1, 4n+1, 8n-1 and 8n+1 are all prime.A069176
Numbers n such that n-1, n+1, 2n-1, 2n+1, 4n-1, 4n+1, 8n-1 and 8n+1 are all prime.
- Maximal power of 2 that divides Phi(n), or the size of the Sylow 2-subgroup of the group of units mod n.A069177
Maximal power of 2 that divides Phi(n), or the size of the Sylow 2-subgroup of the group of units mod n.
- Centered 21-gonal numbers.A069178
Centered 21-gonal numbers.
- Least number X such that for each k in (0 to n-1), 2^k*X-1 and 2^k*X+1 are primes. That is, there are N twin primes, each the "double" of the previous.A069179
Least number X such that for each k in (0 to n-1), 2^k*X-1 and 2^k*X+1 are primes. That is, there are N twin primes, each the "double" of the previous.
- F(n) and n! are relatively prime where F(n) are the Fibonacci numbers.A069180
F(n) and n! are relatively prime where F(n) are the Fibonacci numbers.
- Decimal expansion of 1/1024.A069181
Decimal expansion of 1/1024.
- a(1) = 2, a(2) = -32; a(n) = -16*a(n - 1) + 12*add(binomial(2*n - 2, 2*i)*a(i)*a(n - 1 - i), i = 1 .. n - 2).A069182
a(1) = 2, a(2) = -32; a(n) = -16*a(n - 1) + 12*add(binomial(2*n - 2, 2*i)*a(i)*a(n - 1 - i), i = 1 .. n - 2).
- Expansion of 1/((1-x)(1-x^2)^2(1-x^3)(1-x^6)).A069183
Expansion of 1/((1-x)(1-x^2)^2(1-x^3)(1-x^6)).
- Sum of divisors d of n such that d or n/d is odd.A069184
Sum of divisors d of n such that d or n/d is odd.
- Numbers n such that n=phi(n)*core(n) where phi(x) is the Euler totient function and core(x) the squarefree part of x (the smallest integer such that x*core(x) is a square).A069185
Numbers n such that n=phi(n)*core(n) where phi(x) is the Euler totient function and core(x) the squarefree part of x (the smallest integer such that x*core(x) is a square).
- Numbers n such that core(n)=floor(sqrt(n)), where core(x)=A007913(x) is the squarefree part of x and floor(sqrt(x))=A000196(x).A069186
Numbers n such that core(n)=floor(sqrt(n)), where core(x)=A007913(x) is the squarefree part of x and floor(sqrt(x))=A000196(x).
- Numbers k such that core(k) = ceiling(sqrt(k)) where core(k) is the squarefree part of k (the smallest integer such that k*core(k) is a square).A069187
Numbers k such that core(k) = ceiling(sqrt(k)) where core(k) is the squarefree part of k (the smallest integer such that k*core(k) is a square).
- Look at all numbers formed by multiplying the parts in a partition of n; a(n) = maximal such number which is divisible by n.A069188
Look at all numbers formed by multiplying the parts in a partition of n; a(n) = maximal such number which is divisible by n.
- Numbers k such that A007913(k) < sqrt(k).A069189
Numbers k such that A007913(k) < sqrt(k).
- Centered 24-gonal numbers.A069190
Centered 24-gonal numbers.
- Determinant of n X n matrix defined by m(i,j)=1 if i+j is a prime, m(i,j)=0 otherwise.A069191
Determinant of n X n matrix defined by m(i,j)=1 if i+j is a prime, m(i,j)=0 otherwise.
- Sum of the reversals of the divisors of n.A069192
Sum of the reversals of the divisors of n.
- a(n) = Sum_{d|n} d*phi(n)/phi(d).A069193
a(n) = Sum_{d|n} d*phi(n)/phi(d).
- a(n) = Sum_{d|n} (n/d)*phi(n)/phi(d).A069194
a(n) = Sum_{d|n} (n/d)*phi(n)/phi(d).
- Order of first letter of English name of consecutive days of the week starting from a Monday.A069195
Order of first letter of English name of consecutive days of the week starting from a Monday.
- a(1)=1, a(2)=3; for n>1, a(n+2)=(a(n+1)+a(n))/3 if (a(n+1)+a(n)==0 (mod 3)); a(n+2)=(a(n+1)+a(n))/2 if (a(n+1)+a(n)==0 (mod 2)); and a(n+2)=a(n+1)+a(n) otherwise.A069196
a(1)=1, a(2)=3; for n>1, a(n+2)=(a(n+1)+a(n))/3 if (a(n+1)+a(n)==0 (mod 3)); a(n+2)=(a(n+1)+a(n))/2 if (a(n+1)+a(n)==0 (mod 2)); and a(n+2)=a(n+1)+a(n) otherwise.
- a(1)=1 a(2)=4 a(n+2)=(a(n+1)+a(n))/3 if (a(n+1)+a(n)==0 (mod 3)); a(n+2)=(a(n+1)+a(n))/2 if (a(n+1)+a(n)==0 (mod 2)); a(n+2)=a(n+1)+a(n) otherwise.A069197
a(1)=1 a(2)=4 a(n+2)=(a(n+1)+a(n))/3 if (a(n+1)+a(n)==0 (mod 3)); a(n+2)=(a(n+1)+a(n))/2 if (a(n+1)+a(n)==0 (mod 2)); a(n+2)=a(n+1)+a(n) otherwise.
- a(1)=1 a(2)=6 a(n+2)=(a(n+1)+a(n))/3 if (a(n+1)+a(n)==0 (mod 3)); a(n+2)=(a(n+1)+a(n))/2 if (a(n+1)+a(n)==0 (mod 2)); a(n+2)=a(n+1)+a(n) otherwise.A069198
a(1)=1 a(2)=6 a(n+2)=(a(n+1)+a(n))/3 if (a(n+1)+a(n)==0 (mod 3)); a(n+2)=(a(n+1)+a(n))/2 if (a(n+1)+a(n)==0 (mod 2)); a(n+2)=a(n+1)+a(n) otherwise.
- a(1)=1 a(2)=7 a(n+2)=(a(n+1)+a(n))/3 if (a(n+1)+a(n)==0 (mod 3)); a(n+2)=(a(n+1)+a(n))/2 if (a(n+1)+a(n)==0 (mod 2)); a(n+2)=a(n+1)+a(n) otherwise.A069199
a(1)=1 a(2)=7 a(n+2)=(a(n+1)+a(n))/3 if (a(n+1)+a(n)==0 (mod 3)); a(n+2)=(a(n+1)+a(n))/2 if (a(n+1)+a(n)==0 (mod 2)); a(n+2)=a(n+1)+a(n) otherwise.
- Duplicate of A069218.A069200
Duplicate of A069218.
- a(n) = Sum_{k=1..n} mu(k)^2 * 2^omega(k) where omega(k) is the number of distinct primes in the factorization of k.A069201
a(n) = Sum_{k=1..n} mu(k)^2 * 2^omega(k) where omega(k) is the number of distinct primes in the factorization of k.
- A Collatz-Fibonacci mixture: a(1) = 1, a(2) = 2, a(n+2) = a(n+1)/2+a(n)/2 if a(n+1) and a(n) have the same parity, a(n+2) = a(n+1)+a(n) otherwise.A069202
A Collatz-Fibonacci mixture: a(1) = 1, a(2) = 2, a(n+2) = a(n+1)/2+a(n)/2 if a(n+1) and a(n) have the same parity, a(n+2) = a(n+1)+a(n) otherwise.
- a(1)=0 a(2)=3 a(n+2)=(a(n+1)+a(n))/3 if (a(n+1)+a(n)==0 (mod 3)); a(n+2)=a(n+1)+a(n) otherwise.A069203
a(1)=0 a(2)=3 a(n+2)=(a(n+1)+a(n))/3 if (a(n+1)+a(n)==0 (mod 3)); a(n+2)=a(n+1)+a(n) otherwise.
- Emirps congruent to their reversal mod 4.A069204
Emirps congruent to their reversal mod 4.
- a(n) = Sum_{k=1..n} 2^bigomega(k).A069205
a(n) = Sum_{k=1..n} 2^bigomega(k).
- Let m(n,k) be the sequence defined by m(n,1)=1, m(n,2)=n, m(n,k+2)=(m(n,k+1)+m(n,k))/2 if m(n,k+1)+m(n,k) is even, m(n,k+2)=m(n,k+1)-m(n,k) otherwise. Sequence gives the (experimentally unique) solution to m(n,x)=0 (for k > this solution m(n,k) is constant = +1 or -1 depending on n) or a(n)=0 if there is no solution (in this case the cycle (1,3,2,-1,-3,-2) is reached).A069206
Let m(n,k) be the sequence defined by m(n,1)=1, m(n,2)=n, m(n,k+2)=(m(n,k+1)+m(n,k))/2 if m(n,k+1)+m(n,k) is even, m(n,k+2)=m(n,k+1)-m(n,k) otherwise. Sequence gives the (experimentally unique) solution to m(n,x)=0 (for k > this solution m(n,k) is constant = +1 or -1 depending on n) or a(n)=0 if there is no solution (in this case the cycle (1,3,2,-1,-3,-2) is reached).
- Numbers n such that n^2 + (reversal of n)^2 is prime. Ignore leading 0's.A069207
Numbers n such that n^2 + (reversal of n)^2 is prime. Ignore leading 0's.
- a(n) = Sum_{ d divides n } phi(n)/phi(d).A069208
a(n) = Sum_{ d divides n } phi(n)/phi(d).
- Orders of non-Abelian Z-groups.A069209
Orders of non-Abelian Z-groups.
- a(1)=a(2)=1, a(n+2) = a(n+1)+1 if sign(sin(a(n+1))) = sign(sin(a(n))), a(n+2) = a(n)+1 otherwise.A069210
a(1)=a(2)=1, a(n+2) = a(n+1)+1 if sign(sin(a(n+1))) = sign(sin(a(n))), a(n+2) = a(n)+1 otherwise.