Sequences
392,541 sequences
- Numbers k such that phi(k) divides sigma(k+1) - sigma(k).A072611
Numbers k such that phi(k) divides sigma(k+1) - sigma(k).
- Minimal value of { abs(n-sigma(k)) : k>0 }.A072612
Minimal value of { abs(n-sigma(k)) : k>0 }.
- Number of numbers of the form p*q (p, q distinct primes) less than or equal to n.A072613
Number of numbers of the form p*q (p, q distinct primes) less than or equal to n.
- a(n) = Sum_{k = 1..n} (-1)^(n reduced mod k).A072614
a(n) = Sum_{k = 1..n} (-1)^(n reduced mod k).
- Duplicate of A020871.A072615
Duplicate of A020871.
- Number of essentially different ways of arranging numbers 1 through 2n around a circle so that the sum of each pair of adjacent numbers is prime and the odd (or even) numbers are in order.A072616
Number of essentially different ways of arranging numbers 1 through 2n around a circle so that the sum of each pair of adjacent numbers is prime and the odd (or even) numbers are in order.
- Number of essentially different ways of arranging numbers 1 through 2n around a circle so that the sum of each pair of adjacent numbers is prime, with the odd and even numbers in order in opposite directions.A072617
Number of essentially different ways of arranging numbers 1 through 2n around a circle so that the sum of each pair of adjacent numbers is prime, with the odd and even numbers in order in opposite directions.
- Numbers n for which the prime circle problem has a simple solution: the arrangement of numbers 1 through 2n around a circle is such that the sum of each pair of adjacent numbers is prime and the odd and even numbers are in order in opposite directions.A072618
Numbers n for which the prime circle problem has a simple solution: the arrangement of numbers 1 through 2n around a circle is such that the sum of each pair of adjacent numbers is prime and the odd and even numbers are in order in opposite directions.
- Permutation of natural numbers obtained from the permutation A072088 (zero-based).A072619
Permutation of natural numbers obtained from the permutation A072088 (zero-based).
- Permutation of natural numbers obtained from the permutation A072089 (zero-based).A072620
Permutation of natural numbers obtained from the permutation A072089 (zero-based).
- Permutation of natural numbers obtained from the permutation A072088 (one-based).A072621
Permutation of natural numbers obtained from the permutation A072088 (one-based).
- Permutation of natural numbers obtained from the permutation A072089 (one-based).A072622
Permutation of natural numbers obtained from the permutation A072089 (one-based).
- Numbers n such that A065863(n) = 1, i.e., prime(n) mod (n - Pi(n)) = 1.A072623
Numbers n such that A065863(n) = 1, i.e., prime(n) mod (n - Pi(n)) = 1.
- a(n) = prime(n^2) mod n^2.A072624
a(n) = prime(n^2) mod n^2.
- a(n) = prime(n) mod ceiling(log(prime(n))).A072625
a(n) = prime(n) mod ceiling(log(prime(n))).
- Parity of floor(n/log(n)).A072626
Parity of floor(n/log(n)).
- Number of divisors d of n such that d-1 is prime.A072627
Number of divisors d of n such that d-1 is prime.
- Number of divisors d of n such that d-1 is not prime.A072628
Number of divisors d of n such that d-1 is not prime.
- Parity of n*floor(log n).A072629
Parity of n*floor(log n).
- Values of n where A072629 switches from 01010.. into 0000.. or back.A072630
Values of n where A072629 switches from 01010.. into 0000.. or back.
- Floor( n*log(n) ) mod n.A072631
Floor( n*log(n) ) mod n.
- Solutions to A072631[n]=0.A072632
Solutions to A072631[n]=0.
- Smallest positive integer m where 1^n+2^n+3^n+...+m^n is greater than or equal to (m+1)^n.A072633
Smallest positive integer m where 1^n+2^n+3^n+...+m^n is greater than or equal to (m+1)^n.
- Permutation of natural numbers induced by reranking plane binary trees given in the standard lexicographic order (A014486) with an "arithmetic global ranking algorithm", using A054238 as the pairing function N X N -> N.A072634
Permutation of natural numbers induced by reranking plane binary trees given in the standard lexicographic order (A014486) with an "arithmetic global ranking algorithm", using A054238 as the pairing function N X N -> N.
- Inverse permutation to A072634.A072635
Inverse permutation to A072634.
- Permutation of natural numbers induced by reranking plane binary trees given in the standard lexicographic order (A014486) with an "arithmetic global ranking algorithm", using packA054238tr as the packing bijection N X N -> N.A072636
Permutation of natural numbers induced by reranking plane binary trees given in the standard lexicographic order (A014486) with an "arithmetic global ranking algorithm", using packA054238tr as the packing bijection N X N -> N.
- Inverse permutation to A072636.A072637
Inverse permutation to A072636.
- Number of unary-binary rooted trees of height at most n.A072638
Number of unary-binary rooted trees of height at most n.
- a(0) = 0, a(n) = Sum_{i=0..n-1} 2^((2^i)-1).A072639
a(0) = 0, a(n) = Sum_{i=0..n-1} 2^((2^i)-1).
- Maximum position in A072660 where the value n occurs.A072640
Maximum position in A072660 where the value n occurs.
- Binary widths of the terms of A072638.A072641
Binary widths of the terms of A072638.
- Binary widths of the terms of A072640.A072642
Binary widths of the terms of A072640.
- Half of the binary width of the terms of A014486, the number of digits in A063171(n)/2.A072643
Half of the binary width of the terms of A014486, the number of digits in A063171(n)/2.
- Size of the parenthesizations obtained with the global ranking/unranking scheme A072634-A072637.A072644
Size of the parenthesizations obtained with the global ranking/unranking scheme A072634-A072637.
- Size of the parenthesizations obtained with the global ranking/unranking scheme A072646/A072647.A072645
Size of the parenthesizations obtained with the global ranking/unranking scheme A072646/A072647.
- Composition of the permutations A048680 & A072636, i.e., a(n) = A048680(A072636(n)).A072646
Composition of the permutations A048680 & A072636, i.e., a(n) = A048680(A072636(n)).
- a(n) = A072637(A048679(n)).A072647
a(n) = A072637(A048679(n)).
- a(n) = [log_{Phi}(n*sqrt(5))], where log_{Phi} is logarithm in the base Phi ( = (sqrt(5)+1)/2) and [] stands for the floor function.A072648
a(n) = [log_{Phi}(n*sqrt(5))], where log_{Phi} is logarithm in the base Phi ( = (sqrt(5)+1)/2) and [] stands for the floor function.
- n occurs Fibonacci(n) times (cf. A000045).A072649
n occurs Fibonacci(n) times (cf. A000045).
- Starting from the right (the least significant end) rewrite 0 to 0 and x1 to 1 in the binary expansion of n.A072650
Starting from the right (the least significant end) rewrite 0 to 0 and x1 to 1 in the binary expansion of n.
- Table by antidiagonals used in calculating integer solutions to b^c=c^d with b,c,d>0.A072651
Table by antidiagonals used in calculating integer solutions to b^c=c^d with b,c,d>0.
- Ordered solutions greater than 1 to b^c=c^d, with multiplicity.A072652
Ordered solutions greater than 1 to b^c=c^d, with multiplicity.
- Uniqued integer solutions n to n = b^c = c^d.A072653
Uniqued integer solutions n to n = b^c = c^d.
- Maximum position in A072645 where the value n occurs.A072654
Maximum position in A072645 where the value n occurs.
- Binary widths of the terms of A072654.A072655
Binary widths of the terms of A072654.
- Permutation of natural numbers induced by reranking plane binary trees given in the standard lexicographic order (A014486) with an "arithmetic global ranking algorithm", using packA048680oA054238 as the packing bijection N X N -> N.A072656
Permutation of natural numbers induced by reranking plane binary trees given in the standard lexicographic order (A014486) with an "arithmetic global ranking algorithm", using packA048680oA054238 as the packing bijection N X N -> N.
- Inverse permutation to A072656.A072657
Inverse permutation to A072656.
- Permutation of natural numbers induced by reranking plane binary trees given in the standard lexicographic order (A014486) with an "arithmetic global ranking algorithm", using packA048680oA054238tr as the packing bijection N X N -> N.A072658
Permutation of natural numbers induced by reranking plane binary trees given in the standard lexicographic order (A014486) with an "arithmetic global ranking algorithm", using packA048680oA054238tr as the packing bijection N X N -> N.
- Inverse permutation to A072658.A072659
Inverse permutation to A072658.
- Size of the parenthesizations obtained with the global ranking/unranking scheme A072656-A072659.A072660
Size of the parenthesizations obtained with the global ranking/unranking scheme A072656-A072659.