Sequences
392,541 sequences
- For x > 0 let f(x) = x/2 if x is even, f(x) = (3*x+1)/2 if x is odd (3x+1 or Collatz problem). Sequence gives numbers such that k-1 applications of f lead to k for some k > 0.A066861
For x > 0 let f(x) = x/2 if x is even, f(x) = (3*x+1)/2 if x is odd (3x+1 or Collatz problem). Sequence gives numbers such that k-1 applications of f lead to k for some k > 0.
- Numbers k such that k divides Sum_{i=1..k} gcd(k,i) = A018804(k).A066862
Numbers k such that k divides Sum_{i=1..k} gcd(k,i) = A018804(k).
- Number of binary arrangements without adjacent 1's on n X n staggered hexagonal grid.A066863
Number of binary arrangements without adjacent 1's on n X n staggered hexagonal grid.
- Number of binary arrangements without adjacent 1's on n X n rhombic hexagonal grid.A066864
Number of binary arrangements without adjacent 1's on n X n rhombic hexagonal grid.
- Number of binary arrangements without adjacent 1's on n X n staggered hexagonal torus bent for odd n.A066865
Number of binary arrangements without adjacent 1's on n X n staggered hexagonal torus bent for odd n.
- Number of binary arrangements without adjacent 1's in n X n rhombic hexagonal grid torus.A066866
Number of binary arrangements without adjacent 1's in n X n rhombic hexagonal grid torus.
- Numbers n such that 2^n has 7 as its fourth decimal digit from the right.A066867
Numbers n such that 2^n has 7 as its fourth decimal digit from the right.
- a(n) is the least k such that n + Sum_{i=1..k} A005385(i) is prime; or 0 if none exists.A066868
a(n) is the least k such that n + Sum_{i=1..k} A005385(i) is prime; or 0 if none exists.
- Sum of the first n safe primes.A066869
Sum of the first n safe primes.
- Happy amicable pairs: numbers which belong to an amicable pair in which both terms are happy numbers.A066870
Happy amicable pairs: numbers which belong to an amicable pair in which both terms are happy numbers.
- Harshad (or Niven) amicable pairs: numbers which belong to an amicable pair in which both terms are Harshad (or Niven) numbers.A066871
Harshad (or Niven) amicable pairs: numbers which belong to an amicable pair in which both terms are Harshad (or Niven) numbers.
- a(n) = prime(n)^2 + 1.A066872
a(n) = prime(n)^2 + 1.
- Number of amicable pairs where smaller term of the pair is less than 10^n.A066873
Number of amicable pairs where smaller term of the pair is less than 10^n.
- Number of partitions of n into unitary divisors of n.A066874
Number of partitions of n into unitary divisors of n.
- Numbers k such that prime(k+1) + prime(k-1) = 2*prime(k).A066875
Numbers k such that prime(k+1) + prime(k-1) = 2*prime(k).
- Numbers n such that prime(k+2) + prime(k-2) = 2*prime(k).A066876
Numbers n such that prime(k+2) + prime(k-2) = 2*prime(k).
- a(n) = omega(n!-1), where omega is the number of distinct primes dividing n, A001221.A066877
a(n) = omega(n!-1), where omega is the number of distinct primes dividing n, A001221.
- Primes of the form p^3 - 2 where p is prime.A066878
Primes of the form p^3 - 2 where p is prime.
- n such that there are as many 1's as 0's in the base 2 expansion of Floor(n/2).A066879
n such that there are as many 1's as 0's in the base 2 expansion of Floor(n/2).
- Biased numbers: n such that all terms of the sequence f(n), f(f(n)), f(f(f(n))), ..., 1, where f(k) = floor(k/2), are odd.A066880
Biased numbers: n such that all terms of the sequence f(n), f(f(n)), f(f(f(n))), ..., 1, where f(k) = floor(k/2), are odd.
- Numbers n such that sigma(phi(n))/sigma(n) is an integer >= 4.A066881
Numbers n such that sigma(phi(n))/sigma(n) is an integer >= 4.
- Number of partitions of n into prime divisors of n.A066882
Number of partitions of n into prime divisors of n.
- Number of primes in the interval [p(n), p(n)^2] minus p(n), where p(n) is the n-th prime.A066883
Number of primes in the interval [p(n), p(n)^2] minus p(n), where p(n) is the n-th prime.
- Square array read by upward antidiagonals where the n-th row contains the positive integers with n binary 1's.A066884
Square array read by upward antidiagonals where the n-th row contains the positive integers with n binary 1's.
- a(n) = (prime(n)^2 + 1)/2.A066885
a(n) = (prime(n)^2 + 1)/2.
- Sum of the elements in any transversal of a prime(n) X prime(n) array containing the numbers from 1 to prime(n)^2 in standard order.A066886
Sum of the elements in any transversal of a prime(n) X prime(n) array containing the numbers from 1 to prime(n)^2 in standard order.
- Numbers k such that Omega(phi(k)) = Omega(k) where phi is the Euler totient function and Omega(k) is the number of repeated prime factors in k.A066887
Numbers k such that Omega(phi(k)) = Omega(k) where phi is the Euler totient function and Omega(k) is the number of repeated prime factors in k.
- Number of primes p between triangular numbers T(n) < p <= T(n+1).A066888
Number of primes p between triangular numbers T(n) < p <= T(n+1).
- a(n) = g(P(n)+2) - P(n), where P(n) = Product_{k=1..n} Fibonacci(k) and g(i) is the smallest prime >= i.A066889
a(n) = g(P(n)+2) - P(n), where P(n) = Product_{k=1..n} Fibonacci(k) and g(i) is the smallest prime >= i.
- Cubes that are the sum of three distinct positive cubes.A066890
Cubes that are the sum of three distinct positive cubes.
- Max (k : prime(k+n)-prime(k) = 0 mod(k)).A066891
Max (k : prime(k+n)-prime(k) = 0 mod(k)).
- Card (k : prime(k+n)-prime(k)=0 mod(k)).A066892
Card (k : prime(k+n)-prime(k)=0 mod(k)).
- Numbers k such that k divides (prime(3*k) - prime(2*k)).A066893
Numbers k such that k divides (prime(3*k) - prime(2*k)).
- Numbers k such that prime(2*k) - prime(k) == 0 (mod k).A066894
Numbers k such that prime(2*k) - prime(k) == 0 (mod k).
- Numbers k such that k divides prime(k) + prime(k+1).A066895
Numbers k such that k divides prime(k) + prime(k+1).
- prime(2n) + prime(n) == 0 (mod n).A066896
prime(2n) + prime(n) == 0 (mod n).
- Total number of odd parts in all partitions of n.A066897
Total number of odd parts in all partitions of n.
- Total number of even parts in all partitions of n.A066898
Total number of even parts in all partitions of n.
- a(n) = card({k : phi(k) == n (mod k)}).A066899
a(n) = card({k : phi(k) == n (mod k)}).
- a(n) = max( {k : phi(k)==n (mod(k)) } ).A066900
a(n) = max( {k : phi(k)==n (mod(k)) } ).
- Let phi(k) determine the x-coordinate and prime(k) the y-coordinate of the point A(k). Sequence gives values of n such that points A(n), A(n+1) and A(n+2) form a right triangle with right angle at A(n+1).A066901
Let phi(k) determine the x-coordinate and prime(k) the y-coordinate of the point A(k). Sequence gives values of n such that points A(n), A(n+1) and A(n+2) form a right triangle with right angle at A(n+1).
- Integers k such that phi(prime(k)+1) = phi(prime(k)-1).A066902
Integers k such that phi(prime(k)+1) = phi(prime(k)-1).
- Primes in A006577.A066903
Primes in A006577.
- Triangular numbers in A006577.A066904
Triangular numbers in A006577.
- Squares in A006577.A066905
Squares in A006577.
- Places n where A006577(n) is a prime number.A066906
Places n where A006577(n) is a prime number.
- Number of elements in GL(2,Z_n) x with x^2 == I mod n where I is the identity matrix.A066907
Number of elements in GL(2,Z_n) x with x^2 == I mod n where I is the identity matrix.
- n^n minus largest factorial less than or equal to n^n.A066908
n^n minus largest factorial less than or equal to n^n.
- (product of primes < n that do not divide n) (mod n).A066909
(product of primes < n that do not divide n) (mod n).
- a(1) = 1; a(n+1) = (sum{k=1 to n} a(k) ) (mod n).A066910
a(1) = 1; a(n+1) = (sum{k=1 to n} a(k) ) (mod n).