Sequences
392,541 sequences
- Integers n > 10553 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 10553.A063061
Integers n > 10553 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 10553.
- a(n) = number of 'Reverse and Add!' operations that have to be applied to the n-th term of A063061 in order to obtain a term in the trajectory of 10553.A063062
a(n) = number of 'Reverse and Add!' operations that have to be applied to the n-th term of A063061 in order to obtain a term in the trajectory of 10553.
- 'Reverse and Add!' trajectory of 10563.A063063
'Reverse and Add!' trajectory of 10563.
- Integers n > 10563 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 10563.A063064
Integers n > 10563 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 10563.
- a(n) = number of 'Reverse and Add!' operations that have to be applied to the n-th term of A063064 in order to obtain a term in the trajectory of 10563.A063065
a(n) = number of 'Reverse and Add!' operations that have to be applied to the n-th term of A063064 in order to obtain a term in the trajectory of 10563.
- Numbers expressible as (a^2-1)(b^2-1).A063066
Numbers expressible as (a^2-1)(b^2-1).
- Numbers expressible as (a^2-1)(b^2-1) in at least 2 distinct ways (b>=a>1).A063067
Numbers expressible as (a^2-1)(b^2-1) in at least 2 distinct ways (b>=a>1).
- Smallest number expressible as (a^2-1)(b^2-1) in at least n distinct ways [with b>=a>1].A063068
Smallest number expressible as (a^2-1)(b^2-1) in at least n distinct ways [with b>=a>1].
- Positive integers n such that phi(n) - d(n) = phi(n+1) - d(n+1) where d(n) is the number of divisors of n.A063069
Positive integers n such that phi(n) - d(n) = phi(n+1) - d(n+1) where d(n) is the number of divisors of n.
- a(n) = phi(n) - d(n), where d(n) is the number of divisors function (A000005).A063070
a(n) = phi(n) - d(n), where d(n) is the number of divisors function (A000005).
- Numbers k such that sigma(k)*omega(k) = sigma(k+1)*omega(k+1), where omega(k) is the number of distinct prime divisors of n (A001221).A063071
Numbers k such that sigma(k)*omega(k) = sigma(k+1)*omega(k+1), where omega(k) is the number of distinct prime divisors of n (A001221).
- Sum of divisors of Ramanujan's highly composite numbers, or sigma(A002182(n)).A063072
Sum of divisors of Ramanujan's highly composite numbers, or sigma(A002182(n)).
- Square of determinant of character table of the dihedral group with 2n elements.A063073
Square of determinant of character table of the dihedral group with 2n elements.
- Number of partitions of 2n^2 whose Ferrers-plot fits within a 2n X 2n box; number of ways to cut a 2n X 2n chessboard into two equal-area pieces along a non-descending line from lower left to upper right.A063074
Number of partitions of 2n^2 whose Ferrers-plot fits within a 2n X 2n box; number of ways to cut a 2n X 2n chessboard into two equal-area pieces along a non-descending line from lower left to upper right.
- Number of partitions of 2n^2 whose Ferrers-plot fits within a 2n X 2n box and cover an n X n box; number of ways to cut a 2n X 2n chessboard into two equal-area pieces along a non-descending line from lower left to upper right and passing through the center.A063075
Number of partitions of 2n^2 whose Ferrers-plot fits within a 2n X 2n box and cover an n X n box; number of ways to cut a 2n X 2n chessboard into two equal-area pieces along a non-descending line from lower left to upper right and passing through the center.
- Differences of A011757 ("Primes with square indices").A063076
Differences of A011757 ("Primes with square indices").
- a(n) = phi(n^2 + 1) - 2n.A063077
a(n) = phi(n^2 + 1) - 2n.
- Numbers n such that phi(n)*mu(n) > phi(m)*mu(m) for all m < n.A063078
Numbers n such that phi(n)*mu(n) > phi(m)*mu(m) for all m < n.
- Bisection of A001790.A063079
Bisection of A001790.
- Numbers k such that k/d(k) is prime, where d(k) is the number of divisors of k.A063080
Numbers k such that k/d(k) is prime, where d(k) is the number of divisors of k.
- Dimension of the space of weight 2n cusp forms for Gamma_0( 13 ).A063081
Dimension of the space of weight 2n cusp forms for Gamma_0( 13 ).
- Squares arising in A063076.A063082
Squares arising in A063076.
- Number of permutations of n elements with an odd number of fixed points.A063083
Number of permutations of n elements with an odd number of fixed points.
- a(n) = pi(n-1)*n - pi(n)*(n-1), where pi() = A000720().A063084
a(n) = pi(n-1)*n - pi(n)*(n-1), where pi() = A000720().
- a(n) = usigma(n) - (phi(n) + d(n)), where usigma(n) is the sum of the unitary divisors of n and d(n) is the number of divisors of n.A063085
a(n) = usigma(n) - (phi(n) + d(n)), where usigma(n) is the sum of the unitary divisors of n and d(n) is the number of divisors of n.
- a(n) = gcd(1 + prime(n+1), 1 + prime(n)).A063086
a(n) = gcd(1 + prime(n+1), 1 + prime(n)).
- Dimension of the space of weight 2n cusp forms for Gamma_0( 19 ).A063087
Dimension of the space of weight 2n cusp forms for Gamma_0( 19 ).
- a(n) = Sum_{k=1..n} phi(k) - Sum{k=1..n} d(k), where d() is the number of divisors function.A063088
a(n) = Sum_{k=1..n} phi(k) - Sum{k=1..n} d(k), where d() is the number of divisors function.
- Dimension of the space of weight 2n cusp forms for Gamma_0( 21 ).A063089
Dimension of the space of weight 2n cusp forms for Gamma_0( 21 ).
- a(n)/(n*n!) is the average number of comparisons needed to find a node in a binary search tree containing n nodes inserted in a random order.A063090
a(n)/(n*n!) is the average number of comparisons needed to find a node in a binary search tree containing n nodes inserted in a random order.
- Prime(n) such that gcd(1+prime(n+1), 1+prime(n)) = gcd(-1+prime(n+1), -1+prime(n)).A063091
Prime(n) such that gcd(1+prime(n+1), 1+prime(n)) = gcd(-1+prime(n+1), -1+prime(n)).
- a(0)=1, a(1)=2 and, for n>1, a(n) = a(n-1) + 11*a(n-2).A063092
a(0)=1, a(1)=2 and, for n>1, a(n) = a(n-1) + 11*a(n-2).
- Dimension of the space of weight 2n cusp forms for Gamma_0( 25 ).A063093
Dimension of the space of weight 2n cusp forms for Gamma_0( 25 ).
- Dimension of the space of weight 2n cusp forms for Gamma_0( 26 ).A063094
Dimension of the space of weight 2n cusp forms for Gamma_0( 26 ).
- Record prime gap among first n+1 primes.A063095
Record prime gap among first n+1 primes.
- Non-record differences among consecutive primes.A063096
Non-record differences among consecutive primes.
- Dimension of the space of weight 2n cusp forms for Gamma_0( 29 ).A063097
Dimension of the space of weight 2n cusp forms for Gamma_0( 29 ).
- Dimension of the space of weight 2n cusp forms for Gamma_0( 30 ).A063098
Dimension of the space of weight 2n cusp forms for Gamma_0( 30 ).
- Dimension of the space of weight 2n cusp forms for Gamma_0( 31 ).A063099
Dimension of the space of weight 2n cusp forms for Gamma_0( 31 ).
- Compute the cototient function for the g(n) = p(n+1)-p(n)-1 composite numbers between two consecutive primes. Let the number of distinct cototient values be c(n). Then, a(n) = g(n)-c(n).A063100
Compute the cototient function for the g(n) = p(n+1)-p(n)-1 composite numbers between two consecutive primes. Let the number of distinct cototient values be c(n). Then, a(n) = g(n)-c(n).
- a(n) is the number of divisors of n!*(n! + 1)/2.A063101
a(n) is the number of divisors of n!*(n! + 1)/2.
- Dimension of the space of weight 2n cusp forms for Gamma_0( 34 ).A063102
Dimension of the space of weight 2n cusp forms for Gamma_0( 34 ).
- Numbers k such that sigma(usigma(k)) is prime.A063103
Numbers k such that sigma(usigma(k)) is prime.
- a(0) = 0, a(n) = smallest composite k such that phi(k + 2^n) = phi(k) + 2^n; also cototient(k + 2^n) = cototient(k).A063104
a(0) = 0, a(n) = smallest composite k such that phi(k + 2^n) = phi(k) + 2^n; also cototient(k + 2^n) = cototient(k).
- Dimension of the space of weight 2n cusp forms for Gamma_0( 37 ).A063105
Dimension of the space of weight 2n cusp forms for Gamma_0( 37 ).
- Primes of form !n + 2n - 1.A063106
Primes of form !n + 2n - 1.
- Dimension of the space of weight 2n cusp forms for Gamma_0( 39 ).A063107
Dimension of the space of weight 2n cusp forms for Gamma_0( 39 ).
- a(1) = 1; thereafter a(n+1) = a(n) + product of nonzero digits of a(n).A063108
a(1) = 1; thereafter a(n+1) = a(n) + product of nonzero digits of a(n).
- Dimension of the space of weight 2n cusp forms for Gamma_0( 41 ).A063109
Dimension of the space of weight 2n cusp forms for Gamma_0( 41 ).
- Dimension of the space of weight 2n cusp forms for Gamma_0(42).A063110
Dimension of the space of weight 2n cusp forms for Gamma_0(42).