Sequences
392,541 sequences
- Sum of distinct primes dividing n! + 1.A064011
Sum of distinct primes dividing n! + 1.
- usigma(usigma(n))=3*n where usigma(n) is the sum of unitary divisors of n (A034448).A064012
usigma(usigma(n))=3*n where usigma(n) is the sum of unitary divisors of n (A034448).
- Sum of first n^2 odd primes (=S) is divisible by n and S/n = n mod 2.A064013
Sum of first n^2 odd primes (=S) is divisible by n and S/n = n mod 2.
- Squares with an even number of digits, the respective halves of which are consecutive integers.A064014
Squares with an even number of digits, the respective halves of which are consecutive integers.
- Numbers k such that sopf(k)*nud(k) = pi(k), where sopf(k)=A008472, nud(k)=A034444 and pi(k)=A000720.A064015
Numbers k such that sopf(k)*nud(k) = pi(k), where sopf(k)=A008472, nud(k)=A034444 and pi(k)=A000720.
- a(n) = Sum_{k <= 10^n} cototient(k), where cototient is A051953.A064016
a(n) = Sum_{k <= 10^n} cototient(k), where cototient is A051953.
- Number of ternary trees (A001764) with n nodes and maximal diameter.A064017
Number of ternary trees (A001764) with n nodes and maximal diameter.
- a(n) = A002088(10^n) = Sum_{k <= 10^n} phi(k), sum of the Euler totients phi = A000010.A064018
a(n) = A002088(10^n) = Sum_{k <= 10^n} phi(k), sum of the Euler totients phi = A000010.
- Numbers k such that sopf(k) = sopf(k^2 - 1), where sopf(k) = A008472(k).A064019
Numbers k such that sopf(k) = sopf(k^2 - 1), where sopf(k) = A008472(k).
- Numbers k such that sf(k) = phi(k), where sf(k) = A013928(k).A064020
Numbers k such that sf(k) = phi(k), where sf(k) = A013928(k).
- Squares k^2 such that reverse(k)^2 = reverse(k^2), excluding squares of palindromes.A064021
Squares k^2 such that reverse(k)^2 = reverse(k^2), excluding squares of palindromes.
- a(n) is the smallest value of m such that prod(m) = n*length(m)*sum(m) where prod(m) is the product of the digits of m, length(m) is the number of digits of m, sum(m) is the sum of the digits of m; or 0 if no such m exists.A064022
a(n) is the smallest value of m such that prod(m) = n*length(m)*sum(m) where prod(m) is the product of the digits of m, length(m) is the number of digits of m, sum(m) is the sum of the digits of m; or 0 if no such m exists.
- a(n) is the smallest prime m such that prod(m) = n*length(m)*sum(m) where prod(m) is the product of the digits of m, length(m) is the number of digits of m, sum(m) is the sum of the digits of m; or 0 if no such m exists.A064023
a(n) is the smallest prime m such that prod(m) = n*length(m)*sum(m) where prod(m) is the product of the digits of m, length(m) is the number of digits of m, sum(m) is the sum of the digits of m; or 0 if no such m exists.
- a(n) = minimum value of abs(2^n - 3^k).A064024
a(n) = minimum value of abs(2^n - 3^k).
- Length of period of the continued fraction for sqrt(n!).A064025
Length of period of the continued fraction for sqrt(n!).
- Numbers k such that d(k) + d(k+1) + d(k+2) = 8, where d(k) = A001223.A064026
Numbers k such that d(k) + d(k+1) + d(k+2) = 8, where d(k) = A001223.
- a(n) = (-1)^n*Sum_{d|n} (-1)^d*d^2.A064027
a(n) = (-1)^n*Sum_{d|n} (-1)^d*d^2.
- Sum of the unitary divisors of n!.A064028
Sum of the unitary divisors of n!.
- Numbers k such that sopfr(k) = ud(k), where sopfr = A001414 and ud = A034444.A064029
Numbers k such that sopfr(k) = ud(k), where sopfr = A001414 and ud = A034444.
- Product of unitary divisors of n!.A064030
Product of unitary divisors of n!.
- Product of non-unitary divisors of n!.A064031
Product of non-unitary divisors of n!.
- Product of unitary divisors of binomial(n, floor(n/2)).A064032
Product of unitary divisors of binomial(n, floor(n/2)).
- Product of non-unitary divisors of binomial(n, floor(n/2)) or a(n) = 1 if all divisors are unitary. See A046098.A064033
Product of non-unitary divisors of binomial(n, floor(n/2)) or a(n) = 1 if all divisors are unitary. See A046098.
- 2-dimensional table T(i, j) defined for any integers i and j, read by antidiagonals in the southeast quadrant. T(i, j) gives the "Fibonacci depth" of (i, j): form the Fibonacci sequence starting with i, j: w(0) = i, w(1) = j, w(n) = w(n-1) + w(n-2). It can be shown that for all but finitely many n, the w(n) have the same sign, i.e., are all positive, all negative or all zero. T(i, j), is the smallest number of iterations required to find out which of these cases holds.A064034
2-dimensional table T(i, j) defined for any integers i and j, read by antidiagonals in the southeast quadrant. T(i, j) gives the "Fibonacci depth" of (i, j): form the Fibonacci sequence starting with i, j: w(0) = i, w(1) = j, w(n) = w(n-1) + w(n-2). It can be shown that for all but finitely many n, the w(n) have the same sign, i.e., are all positive, all negative or all zero. T(i, j), is the smallest number of iterations required to find out which of these cases holds.
- Erroneous version of A006534.A064035
Erroneous version of A006534.
- Number of walks of length n on cubic lattice, starting at origin, staying in first (nonnegative) octant.A064036
Number of walks of length n on cubic lattice, starting at origin, staying in first (nonnegative) octant.
- Number of walks of length 2n on cubic lattice, starting and finishing at origin and staying in first (nonnegative) octant.A064037
Number of walks of length 2n on cubic lattice, starting and finishing at origin and staying in first (nonnegative) octant.
- Numerator of average number of swaps needed to bubble sort a string of n distinct letters.A064038
Numerator of average number of swaps needed to bubble sort a string of n distinct letters.
- Reversed inversion vectors for the permutations of A060117, presented as pseudo-decimal numbers.A064039
Reversed inversion vectors for the permutations of A060117, presented as pseudo-decimal numbers.
- Integers whose number of distinct prime divisors is prime.A064040
Integers whose number of distinct prime divisors is prime.
- Number of divisors of A064040(n).A064041
Number of divisors of A064040(n).
- At step n in computing A064413, sequence gives smallest multiple of 5 not yet seen, divided by 5.A064042
At step n in computing A064413, sequence gives smallest multiple of 5 not yet seen, divided by 5.
- Number of length 3 walks on an n-dimensional hypercubic lattice starting at the origin and staying in the nonnegative part.A064043
Number of length 3 walks on an n-dimensional hypercubic lattice starting at the origin and staying in the nonnegative part.
- Square array read by antidiagonals of number of length k walks on an n-dimensional hypercubic lattice starting at the origin and staying in the nonnegative part.A064044
Square array read by antidiagonals of number of length k walks on an n-dimensional hypercubic lattice starting at the origin and staying in the nonnegative part.
- Square array read by antidiagonals of number of length 2k walks on an n-dimensional hypercubic lattice starting and finishing at the origin and staying in the nonnegative part.A064045
Square array read by antidiagonals of number of length 2k walks on an n-dimensional hypercubic lattice starting and finishing at the origin and staying in the nonnegative part.
- Number of length 6 walks on an n-dimensional hypercubic lattice starting and finishing at the origin and staying in the nonnegative part.A064046
Number of length 6 walks on an n-dimensional hypercubic lattice starting and finishing at the origin and staying in the nonnegative part.
- Number of numbers only appearing once in 1-to-n multiplication table.A064047
Number of numbers only appearing once in 1-to-n multiplication table.
- Number of most frequently occurring numbers in the 1-to-n multiplication table.A064048
Number of most frequently occurring numbers in the 1-to-n multiplication table.
- Number of possible arrangements of numbers 1 to n*(n+1)/2 in a triangle of n rows so that each row and each diagonal is increasing or decreasing.A064049
Number of possible arrangements of numbers 1 to n*(n+1)/2 in a triangle of n rows so that each row and each diagonal is increasing or decreasing.
- Number of essentially different (not mappable to each other by reflection or rotation) arrangements of numbers 1 to n*(n+1)/2 in a triangle of n rows, in such a way that each row and each diagonal is increasing or decreasing.A064050
Number of essentially different (not mappable to each other by reflection or rotation) arrangements of numbers 1 to n*(n+1)/2 in a triangle of n rows, in such a way that each row and each diagonal is increasing or decreasing.
- a(n) = 2*prime(n)^2 - prime(n+1)^2.A064051
a(n) = 2*prime(n)^2 - prime(n+1)^2.
- Not sqrt(n)-smooth: some prime factor of n is > sqrt(n).A064052
Not sqrt(n)-smooth: some prime factor of n is > sqrt(n).
- Auxiliary sequence gamma(n) used to compute coefficients in series expansion of the mock theta function f(q) via A(n) = Sum_{r=0..n} p(r)*gamma(n-r), with p(r) the partition function A000041.A064053
Auxiliary sequence gamma(n) used to compute coefficients in series expansion of the mock theta function f(q) via A(n) = Sum_{r=0..n} p(r)*gamma(n-r), with p(r) the partition function A000041.
- Tenth column of trinomial coefficients.A064054
Tenth column of trinomial coefficients.
- Ninth column of quadrinomial coefficients.A064055
Ninth column of quadrinomial coefficients.
- Seventh column of quintinomial coefficients.A064056
Seventh column of quintinomial coefficients.
- Eighth column of quintinomial coefficients.A064057
Eighth column of quintinomial coefficients.
- Ninth column of quintinomial coefficients.A064058
Ninth column of quintinomial coefficients.
- Seventh column of Catalan triangle A009766.A064059
Seventh column of Catalan triangle A009766.
- Number of connected, homeomorphically irreducible (also called series-reduced) trees with n >= 2 labeled leaves (numbers in nondecreasing order).A064060
Number of connected, homeomorphically irreducible (also called series-reduced) trees with n >= 2 labeled leaves (numbers in nondecreasing order).