Sequences
392,541 sequences
- Sum of the digits of all n-digit numbers.A078761
Sum of the digits of all n-digit numbers.
- Numbers n such that n + sigma(n) is prime.A078762
Numbers n such that n + sigma(n) is prime.
- List primes between (2n-1)^2 and (2n)^2.A078763
List primes between (2n-1)^2 and (2n)^2.
- List primes between (2n)^2 and (2n+1)^2.A078764
List primes between (2n)^2 and (2n+1)^2.
- Prime numbers occurring at integer Pythagorean distance (radius) from 1 in Ulam square prime-spiral. Primes on axes are excluded.A078765
Prime numbers occurring at integer Pythagorean distance (radius) from 1 in Ulam square prime-spiral. Primes on axes are excluded.
- Number of primes less than n*phi(n).A078766
Number of primes less than n*phi(n).
- Let f(n) = A003434(n) be the number of iterations of phi needed to reach 1. Then a(n) = max(f(1), f(2), ..., f(n)).A078767
Let f(n) = A003434(n) be the number of iterations of phi needed to reach 1. Then a(n) = max(f(1), f(2), ..., f(n)).
- a(n) is the number of iterations of k -> sigma(k) + 1 needed to reach a prime, or 0 if no prime is reached.A078768
a(n) is the number of iterations of k -> sigma(k) + 1 needed to reach a prime, or 0 if no prime is reached.
- Numbers k such that k * phi(k)^2 < sigma(k)^2.A078769
Numbers k such that k * phi(k)^2 < sigma(k)^2.
- a(n) = the least positive integer k such that k^2 + k + 2*n - 1 is prime.A078770
a(n) = the least positive integer k such that k^2 + k + 2*n - 1 is prime.
- a(n) = A008475(n) - A001414(n).A078771
a(n) = A008475(n) - A001414(n).
- a(n) = phi(n-p) where p is largest prime < n, a(1) = a(2) = 1 by convention.A078772
a(n) = phi(n-p) where p is largest prime < n, a(1) = a(2) = 1 by convention.
- a(n) is the largest prime less than or equal to phi(n), a(1) = a(2) = 0.A078773
a(n) is the largest prime less than or equal to phi(n), a(1) = a(2) = 0.
- a(n) = n*phi(n*phi(n)).A078774
a(n) = n*phi(n*phi(n)).
- Numbers k such that k!/phi(k)!+1 is prime.A078775
Numbers k such that k!/phi(k)!+1 is prime.
- Numbers k such that phi(k-1) < phi(k) < phi(k+1), where phi is the Euler totient function (A000010).A078776
Numbers k such that phi(k-1) < phi(k) < phi(k+1), where phi is the Euler totient function (A000010).
- a(n) = the least positive integer k such that binomial(2k,k) + k + n is prime, if such k exists; = 0, otherwise.A078777
a(n) = the least positive integer k such that binomial(2k,k) + k + n is prime, if such k exists; = 0, otherwise.
- Numbers n such that n!+1 is a semiprime.A078778
Numbers n such that n!+1 is a semiprime.
- Union of S, 2S and 4S, where S = odd squarefree numbers (A056911).A078779
Union of S, 2S and 4S, where S = odd squarefree numbers (A056911).
- Number of different digraphs on an n-cube.A078780
Number of different digraphs on an n-cube.
- Numbers n such that n!-1 is a semiprime.A078781
Numbers n such that n!-1 is a semiprime.
- Nonprimes (A018252) with prime (A000040) subscripts.A078782
Nonprimes (A018252) with prime (A000040) subscripts.
- a(0) = 0; a(1)=1; for n>1, a(n) = least positive integer m not among a(1),...,a(n-1) such that |m-a(n-1)| > |a(n-1)-a(n-2)|.A078783
a(0) = 0; a(1)=1; for n>1, a(n) = least positive integer m not among a(1),...,a(n-1) such that |m-a(n-1)| > |a(n-1)-a(n-2)|.
- Primes on axis of Ulam square spiral (with rows ... / 7 8 9 / 6 1 2 / 5 4 3 / ... ) with origin at (1).A078784
Primes on axis of Ulam square spiral (with rows ... / 7 8 9 / 6 1 2 / 5 4 3 / ... ) with origin at (1).
- Duplicate of A053016.A078785
Duplicate of A053016.
- Period of cycle of the inventory sequence (as in A063850) starting with n.A078786
Period of cycle of the inventory sequence (as in A063850) starting with n.
- a(n) = 101*n + 1.A078787
a(n) = 101*n + 1.
- a(n) is the smallest m > 2 such that (1 - n) mod m = 0, or 0 if no such number exists.A078788
a(n) is the smallest m > 2 such that (1 - n) mod m = 0, or 0 if no such number exists.
- Expansion of (1-4*x+2*x^2)/(1-7*x+13*x^2-4*x^3).A078789
Expansion of (1-4*x+2*x^2)/(1-7*x+13*x^2-4*x^3).
- Palindromic primes with successive increasing difference: a(k)-a(k-1) < a(k+1)- a(k).A078790
Palindromic primes with successive increasing difference: a(k)-a(k-1) < a(k+1)- a(k).
- Expansion of Auxiliary function L(1-m) / 4 in powers of m / 16.A078791
Expansion of Auxiliary function L(1-m) / 4 in powers of m / 16.
- Number of unlabeled 3-trees on n vertices.A078792
Number of unlabeled 3-trees on n vertices.
- Number of unlabeled 4-trees on n vertices.A078793
Number of unlabeled 4-trees on n vertices.
- a(n) = (-1)^(n+1) * Sum_{k=0..n} 16^k * B(2k) * C(2n+1,2k) where B(k) is the k-th Bernoulli number.A078794
a(n) = (-1)^(n+1) * Sum_{k=0..n} 16^k * B(2k) * C(2n+1,2k) where B(k) is the k-th Bernoulli number.
- Concatenate first n triangular numbers.A078795
Concatenate first n triangular numbers.
- a(n) = 2*ceiling(n*phi) - ceiling(n*sqrt(5)) where phi=(1+sqrt(5))/2 is the Golden ratio.A078796
a(n) = 2*ceiling(n*phi) - ceiling(n*sqrt(5)) where phi=(1+sqrt(5))/2 is the Golden ratio.
- Sum of square displacements over all self-avoiding n-step walks on a square lattice with the first step specified. Numerator of mean square displacement s(n)=a(n)/A046661(n).A078797
Sum of square displacements over all self-avoiding n-step walks on a square lattice with the first step specified. Numerator of mean square displacement s(n)=a(n)/A046661(n).
- Sum of Manhattan distances over all self-avoiding n-step walks on square lattice. Numerator of mean Manhattan displacement s(n) = a(n)/A046661(n).A078798
Sum of Manhattan distances over all self-avoiding n-step walks on square lattice. Numerator of mean Manhattan displacement s(n) = a(n)/A046661(n).
- Sum of square displacements over all self-avoiding walks on square lattice trapped after n steps.A078799
Sum of square displacements over all self-avoiding walks on square lattice trapped after n steps.
- Sum of end-to-end Manhattan distances over all self-avoiding walks on square lattice trapped after n steps.A078800
Sum of end-to-end Manhattan distances over all self-avoiding walks on square lattice trapped after n steps.
- Expansion of Gaussian product of arithmetic mean and Lehmer mean evaluated at 1 + 4*x.A078801
Expansion of Gaussian product of arithmetic mean and Lehmer mean evaluated at 1 + 4*x.
- Triangular array T given by T(n,k) = number of 01-words of length n containing k 1's, no three of which are consecutive.A078802
Triangular array T given by T(n,k) = number of 01-words of length n containing k 1's, no three of which are consecutive.
- Triangular array T given by T(n,k) = number of compositions of n into k parts, each in the set {1,2,3}.A078803
Triangular array T given by T(n,k) = number of compositions of n into k parts, each in the set {1,2,3}.
- Triangular array T given by T(n,k)= number of 01-words of length n having exactly k 1's and every runlength of 1's odd.A078804
Triangular array T given by T(n,k)= number of 01-words of length n having exactly k 1's and every runlength of 1's odd.
- Triangular array T given by T(n,k) = number of 01-words of length n having exactly k 1's, every runlength of 1's odd and initial letter 0.A078805
Triangular array T given by T(n,k) = number of 01-words of length n having exactly k 1's, every runlength of 1's odd and initial letter 0.
- Triangular array T given by T(n,k)= number of 01-words of length n having exactly k 1's, every runlength of 1's odd and initial letter 1.A078806
Triangular array T given by T(n,k)= number of 01-words of length n having exactly k 1's, every runlength of 1's odd and initial letter 1.
- Triangular array T given by T(n,k) = number of 01-words of length n having exactly k 1's, all runlengths odd and first letter 0.A078807
Triangular array T given by T(n,k) = number of 01-words of length n having exactly k 1's, all runlengths odd and first letter 0.
- Triangular array T given by T(n,k) = number of 01-words of length n having exactly k 1's, all runlengths odd and first letter 1.A078808
Triangular array T given by T(n,k) = number of 01-words of length n having exactly k 1's, all runlengths odd and first letter 1.
- Number of divisors of the average of consecutive odd primes.A078809
Number of divisors of the average of consecutive odd primes.
- a(n) = A078218(n)/n.A078810
a(n) = A078218(n)/n.