Sequences
392,541 sequences
- Primes with first digit 5.A045711
Primes with first digit 5.
- Primes with first digit 6.A045712
Primes with first digit 6.
- Primes with first digit 7.A045713
Primes with first digit 7.
- Primes with first digit 8.A045714
Primes with first digit 8.
- Primes with first digit 9.A045715
Primes with first digit 9.
- a(n) is the binary order (A029837) of the n-th primorial number, A002110(n).A045716
a(n) is the binary order (A029837) of the n-th primorial number, A002110(n).
- For each prime p take the sum of nonprimes < p.A045717
For each prime p take the sum of nonprimes < p.
- Nearest neighbors of primes.A045718
Nearest neighbors of primes.
- Number of primes embedded in n-th prime.A045719
Number of primes embedded in n-th prime.
- 3-fold convolution of A001700(n), n >= 0.A045720
3-fold convolution of A001700(n), n >= 0.
- a(n) = binomial(3*n+1,n).A045721
a(n) = binomial(3*n+1,n).
- Number of border edges in all noncrossing rooted trees on n nodes.A045722
Number of border edges in all noncrossing rooted trees on n nodes.
- Number of configurations, excluding reflections and black-white interchanges, of n black and n white beads on a string.A045723
Number of configurations, excluding reflections and black-white interchanges, of n black and n white beads on a string.
- Convolution of Catalan numbers A000108 with A020918.A045724
Convolution of Catalan numbers A000108 with A020918.
- Fibonacci numbers having initial digit '1'.A045725
Fibonacci numbers having initial digit '1'.
- Fibonacci numbers having initial digit '2'.A045726
Fibonacci numbers having initial digit '2'.
- Fibonacci numbers having initial digit '3'.A045727
Fibonacci numbers having initial digit '3'.
- Fibonacci numbers having initial digit '4'.A045728
Fibonacci numbers having initial digit '4'.
- Fibonacci numbers having initial digit '5'.A045729
Fibonacci numbers having initial digit '5'.
- Fibonacci numbers having initial digit '6'.A045730
Fibonacci numbers having initial digit '6'.
- Fibonacci numbers having initial digit '7'.A045731
Fibonacci numbers having initial digit '7'.
- Fibonacci numbers having initial digit '8'.A045732
Fibonacci numbers having initial digit '8'.
- Fibonacci numbers having initial digit '9'.A045733
Fibonacci numbers having initial digit '9'.
- Smallest Fibonacci number beginning "n^2".A045734
Smallest Fibonacci number beginning "n^2".
- Concatenation of 2 or more prime numbers is prime (each term starts where previous term left off).A045735
Concatenation of 2 or more prime numbers is prime (each term starts where previous term left off).
- Smallest positive integer requiring n syllables to pronounce in American English.A045736
Smallest positive integer requiring n syllables to pronounce in American English.
- Number of nonroot branch nodes in all noncrossing rooted trees on n nodes on a circle.A045737
Number of nonroot branch nodes in all noncrossing rooted trees on n nodes on a circle.
- Number of branches in all noncrossing rooted trees on n nodes on a circle.A045738
Number of branches in all noncrossing rooted trees on n nodes on a circle.
- Number of edges in all noncrossing forests on n nodes on a circle.A045739
Number of edges in all noncrossing forests on n nodes on a circle.
- Number of components in all forests on nodes on a circle.A045740
Number of components in all forests on nodes on a circle.
- Number of edges in all noncrossing connected graphs on n nodes on a circle.A045741
Number of edges in all noncrossing connected graphs on n nodes on a circle.
- Number of interior faces in all noncrossing connected graphs on n nodes on a circle.A045742
Number of interior faces in all noncrossing connected graphs on n nodes on a circle.
- Number of noncrossing connected graphs on n nodes on a circle having no triangular faces.A045743
Number of noncrossing connected graphs on n nodes on a circle having no triangular faces.
- Number of noncrossing connected graphs on n nodes on a circle having no four-sided faces.A045744
Number of noncrossing connected graphs on n nodes on a circle having no four-sided faces.
- Numbers n such that sum of proper divisors s(n) is a triangular number T(k).A045745
Numbers n such that sum of proper divisors s(n) is a triangular number T(k).
- Numbers whose sum of divisors is a triangular number.A045746
Numbers whose sum of divisors is a triangular number.
- Number of prime factors of n!!!! (A007662), with multiplicity.A045747
Number of prime factors of n!!!! (A007662), with multiplicity.
- a(n) is the number consisting of the last n digits (although any leading 0's among those last n digits are omitted) of Sum_{j=1..k} j! for all sufficiently large k.A045748
a(n) is the number consisting of the last n digits (although any leading 0's among those last n digits are omitted) of Sum_{j=1..k} j! for all sufficiently large k.
- Extension of Beatty sequence; complement of A045750.A045749
Extension of Beatty sequence; complement of A045750.
- Extension of Beatty sequence, complement of A045749.A045750
Extension of Beatty sequence, complement of A045749.
- Numbers k such that 4*k + 1 is not prime.A045751
Numbers k such that 4*k + 1 is not prime.
- 4n-1 is composite.A045752
4n-1 is composite.
- Numbers n such that 4n-1 and 4n+1 are both primes.A045753
Numbers n such that 4n-1 and 4n+1 are both primes.
- 7-fold factorials: a(n) = Product_{k=0..n-1} (7*k+1).A045754
7-fold factorials: a(n) = Product_{k=0..n-1} (7*k+1).
- 8-fold factorials: a(n) = Product_{k=0..n-1} (8*k+1).A045755
8-fold factorials: a(n) = Product_{k=0..n-1} (8*k+1).
- Expansion of e.g.f. (1-9*x)^(-1/9), 9-factorial numbers.A045756
Expansion of e.g.f. (1-9*x)^(-1/9), 9-factorial numbers.
- 10-factorial numbers.A045757
10-factorial numbers.
- Duplicate of A035474.A045758
Duplicate of A035474.
- Maris-McGwire numbers: numbers k such that f(k) = f(k+1), where f(k) = sum of digits of k + sum of digits of prime factors of k (including multiplicities).A045759
Maris-McGwire numbers: numbers k such that f(k) = f(k+1), where f(k) = sum of digits of k + sum of digits of prime factors of k (including multiplicities).
- Smallest Maris-McGwire k-tuple (k>1) for each k: f(n) = f(n+1) = ... = f(n+k-1), where f is defined in comments.A045760
Smallest Maris-McGwire k-tuple (k>1) for each k: f(n) = f(n+1) = ... = f(n+k-1), where f is defined in comments.