Sequences
392,541 sequences
- Number of ternary Lyndon words of length n with trace 0 and subtrace 2 over GF(3).A053561
Number of ternary Lyndon words of length n with trace 0 and subtrace 2 over GF(3).
- Number of ternary Lyndon words of length n with trace 1 and subtrace 0 over GF(3). Same as the number of ternary Lyndon words of length n with trace 2 and subtrace 0 over GF(3).A053562
Number of ternary Lyndon words of length n with trace 1 and subtrace 0 over GF(3). Same as the number of ternary Lyndon words of length n with trace 2 and subtrace 0 over GF(3).
- Number of ternary Lyndon words of length n with trace 1 and subtrace 1 over GF(3). Same as the number of ternary Lyndon words of length n with trace 2 and subtrace 1 over GF(3).A053563
Number of ternary Lyndon words of length n with trace 1 and subtrace 1 over GF(3). Same as the number of ternary Lyndon words of length n with trace 2 and subtrace 1 over GF(3).
- Number of ternary Lyndon words of length n with trace 1 and subtrace 2 over GF(3). Same as the number of ternary Lyndon words of length n with trace 2 and subtrace 2 over GF(3).A053564
Number of ternary Lyndon words of length n with trace 1 and subtrace 2 over GF(3). Same as the number of ternary Lyndon words of length n with trace 2 and subtrace 2 over GF(3).
- a(n) = 2^(n-1)*(3*n-4).A053565
a(n) = 2^(n-1)*(3*n-4).
- Expansion of (11*x-2)/(1-3*x)^2.A053566
Expansion of (11*x-2)/(1-3*x)^2.
- Stirling numbers of first kind, s(n+5, n).A053567
Stirling numbers of first kind, s(n+5, n).
- Totients of nontotient numbers.A053568
Totients of nontotient numbers.
- Sum of divisors of numbers which cannot be sum of divisors of any number.A053569
Sum of divisors of numbers which cannot be sum of divisors of any number.
- Sum of totient functions over arguments running through reduced residue system of n.A053570
Sum of totient functions over arguments running through reduced residue system of n.
- Sum of totient functions over arguments running through numbers unrelated to n.A053571
Sum of totient functions over arguments running through numbers unrelated to n.
- Maximal number of spanning trees in a planar graph with n nodes.A053572
Maximal number of spanning trees in a planar graph with n nodes.
- a(n) = 5*a(n-1) + 14*a(n-2), a(0)=1, a(1)=5.A053573
a(n) = 5*a(n-1) + 14*a(n-2), a(0)=1, a(1)=5.
- Exponent of 2 in phi(n) where phi(n) = A000010(n).A053574
Exponent of 2 in phi(n) where phi(n) = A000010(n).
- Odd part of phi(n): a(n) = A000265(A000010(n)).A053575
Odd part of phi(n): a(n) = A000265(A000010(n)).
- Smallest number whose Euler totient is divisible by 2^n.A053576
Smallest number whose Euler totient is divisible by 2^n.
- Cototient function n - phi(n) is a power of 2.A053577
Cototient function n - phi(n) is a power of 2.
- Values of cototient function for A053577.A053578
Values of cototient function for A053577.
- Composite numbers whose cototient (A051953) is a power of 2.A053579
Composite numbers whose cototient (A051953) is a power of 2.
- Primes having only {0, 6, 8, 9} as digits.A053580
Primes having only {0, 6, 8, 9} as digits.
- First differences of the Poly-Bernoulli numbers B_n^(k) with k=-2 (A027649).A053581
First differences of the Poly-Bernoulli numbers B_n^(k) with k=-2 (A027649).
- a(n+1) is the smallest prime ending with a(n), where a(1)=1.A053582
a(n+1) is the smallest prime ending with a(n), where a(1)=1.
- a(n+1) is the smallest prime ending with (but not equal to) a(n), where a(1)=3.A053583
a(n+1) is the smallest prime ending with (but not equal to) a(n), where a(1)=3.
- a(n+1) is the smallest prime ending with a(n), where a(1)=7.A053584
a(n+1) is the smallest prime ending with a(n), where a(1)=7.
- If n = p_1^e_1 * ... * p_k^e_k, p_1 < ... < p_k primes, then a(n) = p_k^e_k.A053585
If n = p_1^e_1 * ... * p_k^e_k, p_1 < ... < p_k primes, then a(n) = p_k^e_k.
- Primes formed by concatenating n consecutive decreasing numbers starting with a prime p(n) and ending with the previous prime p(n-1).A053586
Primes formed by concatenating n consecutive decreasing numbers starting with a prime p(n) and ending with the previous prime p(n-1).
- Indices of A052344 (ways to write n as sum of two nonzero triangular numbers) where record values are reached.A053587
Indices of A052344 (ways to write n as sum of two nonzero triangular numbers) where record values are reached.
- Number of self-complementary 4-multigraphs on n nodes.A053588
Number of self-complementary 4-multigraphs on n nodes.
- Greatest primorial number (A002110) which divides n.A053589
Greatest primorial number (A002110) which divides n.
- Product of the longest chain of consecutive primes (starting with A020639(n)) which divides n.A053590
Product of the longest chain of consecutive primes (starting with A020639(n)) which divides n.
- Closed 3-dimensional ball numbers (version 1): a(n)= number of integer points (i,j,k) contained in a closed ball of diameter n, centered at (0,0,0).A053591
Closed 3-dimensional ball numbers (version 1): a(n)= number of integer points (i,j,k) contained in a closed ball of diameter n, centered at (0,0,0).
- Open 3-dimensional ball numbers (version 1): a(n) is the number of integer points (i,j,k) contained in an open ball of diameter n, centered at (0,0,0).A053592
Open 3-dimensional ball numbers (version 1): a(n) is the number of integer points (i,j,k) contained in an open ball of diameter n, centered at (0,0,0).
- Closed 3-dimensional ball numbers (version 2): a(n)= number of integer points (i,j,k) contained in a closed ball of diameter n, centered at (1/2,0,0).A053593
Closed 3-dimensional ball numbers (version 2): a(n)= number of integer points (i,j,k) contained in a closed ball of diameter n, centered at (1/2,0,0).
- Open 3-dimensional ball numbers (version 2): a(n) is the number of integer points (i,j,k) contained in an open ball of diameter n, centered at (1/2,0,0).A053594
Open 3-dimensional ball numbers (version 2): a(n) is the number of integer points (i,j,k) contained in an open ball of diameter n, centered at (1/2,0,0).
- Open 3-dimensional ball numbers (version 3): a(n) is the number of integer points (i,j,k) contained in an open ball of diameter n, centered at (1/2,1/2,0).A053595
Open 3-dimensional ball numbers (version 3): a(n) is the number of integer points (i,j,k) contained in an open ball of diameter n, centered at (1/2,1/2,0).
- Open 3-dimensional ball numbers (version 4): a(n) is the number of integer points (i,j,k) contained in an open ball of diameter n, centered at (1/2, 1/2, 1/2).A053596
Open 3-dimensional ball numbers (version 4): a(n) is the number of integer points (i,j,k) contained in an open ball of diameter n, centered at (1/2, 1/2, 1/2).
- Let prime(i) = i-th prime (A000040), let d(i) = prime(i+1)-prime(i) (A001223); a(n) = number of distinct numbers among d(n), d(n+1), d(n+2), ... before first duplicate is encountered.A053597
Let prime(i) = i-th prime (A000040), let d(i) = prime(i+1)-prime(i) (A001223); a(n) = number of distinct numbers among d(n), d(n+1), d(n+2), ... before first duplicate is encountered.
- Number of n-node unlabeled digraphs without isolated nodes.A053598
Number of n-node unlabeled digraphs without isolated nodes.
- Number of nonempty subsequences {s(k)} of 1..n such that the difference sequence is palindromic.A053599
Number of nonempty subsequences {s(k)} of 1..n such that the difference sequence is palindromic.
- a(1) = 2; for n>=1, a(n+1) is the smallest palindromic prime with a(n) as a central substring.A053600
a(1) = 2; for n>=1, a(n+1) is the smallest palindromic prime with a(n) as a central substring.
- Number of bases of an n-dimensional vector space over GF(2).A053601
Number of bases of an n-dimensional vector space over GF(2).
- a(n) = a(n-1) - (-1)^n*a(n-2), a(0)=0, a(1)=1.A053602
a(n) = a(n-1) - (-1)^n*a(n-2), a(0)=0, a(1)=1.
- Number of ways to write n as an ordered sum of two nonzero triangular numbers.A053603
Number of ways to write n as an ordered sum of two nonzero triangular numbers.
- Number of ways to write n as an ordered sum of 3 nonzero triangular numbers.A053604
Number of ways to write n as an ordered sum of 3 nonzero triangular numbers.
- Total multiplicity of the eigenvalue 0 in the spectra of the n^(n-2) labeled trees on n vertices.A053605
Total multiplicity of the eigenvalue 0 in the spectra of the n^(n-2) labeled trees on n vertices.
- a(n) = (Fibonacci(6*n+3) - 2)/4.A053606
a(n) = (Fibonacci(6*n+3) - 2)/4.
- Primes p such that a pure prime power occurs between p and the next prime.A053607
Primes p such that a pure prime power occurs between p and the next prime.
- Numbers x = LCM(1,2,...,k) such that x^2 + 1 is prime.A053608
Numbers x = LCM(1,2,...,k) such that x^2 + 1 is prime.
- Primes of form x^2+1 where x = LCM(1,2,...,k) for some k.A053609
Primes of form x^2+1 where x = LCM(1,2,...,k) for some k.
- Number of positive squares needed to sum to n using the greedy algorithm.A053610
Number of positive squares needed to sum to n using the greedy algorithm.