Sequences
392,541 sequences
- a(0) = 1; for n>0, a(n) = 1 + coefficient of x^n in expansion of Product_{ n >= 2, n not of the form 2^k-1 } (1+x^n).A078661
a(0) = 1; for n>0, a(n) = 1 + coefficient of x^n in expansion of Product_{ n >= 2, n not of the form 2^k-1 } (1+x^n).
- Number of balanced numbers <= 2^n.A078662
Number of balanced numbers <= 2^n.
- a(n) = Sum_{i=1..n} Ulam(i), where Ulam(i) denotes the i-th Ulam number.A078663
a(n) = Sum_{i=1..n} Ulam(i), where Ulam(i) denotes the i-th Ulam number.
- Number of divisors of the n-th Ulam number.A078664
Number of divisors of the n-th Ulam number.
- Maximum absolute value of coefficients of characteristic polynomial of M_n, the n X n matrix m_(i,j) = i mod j.A078665
Maximum absolute value of coefficients of characteristic polynomial of M_n, the n X n matrix m_(i,j) = i mod j.
- Number of isomorphism classes of simple quadrangulations of the sphere having n+2 vertices and n faces, minimal degree 3, with orientation-reversing isomorphisms permitted.A078666
Number of isomorphism classes of simple quadrangulations of the sphere having n+2 vertices and n faces, minimal degree 3, with orientation-reversing isomorphisms permitted.
- Integers that occur more than once as the difference of the squares of two consecutive primes.A078667
Integers that occur more than once as the difference of the squares of two consecutive primes.
- Primes that are the difference between two powers: y^z - x^z = prime.A078668
Primes that are the difference between two powers: y^z - x^z = prime.
- Number of times n appears among the decimal digits of (n!)^n.A078669
Number of times n appears among the decimal digits of (n!)^n.
- Number of times n appears among the decimal digits of (n!)!.A078670
Number of times n appears among the decimal digits of (n!)!.
- Number of times the n-th prime appears among the decimal digits of 2^(2^n) + 1, the Fermat numbers.A078671
Number of times the n-th prime appears among the decimal digits of 2^(2^n) + 1, the Fermat numbers.
- Number of simple 4-regular 4-edge-connected but not 3-connected plane graphs on n nodes.A078672
Number of simple 4-regular 4-edge-connected but not 3-connected plane graphs on n nodes.
- Number of ways of arranging the numbers 1..n in a circle so that there is no consecutive triple i, i+1, i+2 or i, i-1, i-2 (mod n).A078673
Number of ways of arranging the numbers 1..n in a circle so that there is no consecutive triple i, i+1, i+2 or i, i-1, i-2 (mod n).
- Number of ways to lace a shoe that has n pairs of eyelets, assuming the lacing satisfies certain conditions.A078674
Number of ways to lace a shoe that has n pairs of eyelets, assuming the lacing satisfies certain conditions.
- Number of ways to lace a shoe that has n pairs of eyelets.A078675
Number of ways to lace a shoe that has n pairs of eyelets.
- Number of symmetric ways to lace a shoe that has n pairs of eyelets.A078676
Number of symmetric ways to lace a shoe that has n pairs of eyelets.
- Write n in binary; repeatedly sum the "digits" until reaching 1; a(n) = sum of these sums (including '1' and n itself).A078677
Write n in binary; repeatedly sum the "digits" until reaching 1; a(n) = sum of these sums (including '1' and n itself).
- Number of binary strings with n 1's and n 0's avoiding zigzags, that is avoiding the substrings 101 and 010.A078678
Number of binary strings with n 1's and n 0's avoiding zigzags, that is avoiding the substrings 101 and 010.
- Number of Grand Motzkin paths of length n with no zigzags, that is with no factors UDU and DUD.A078679
Number of Grand Motzkin paths of length n with no zigzags, that is with no factors UDU and DUD.
- Smallest m > 0 such that n*2^m + 1 is prime, or 0 if no such m exists.A078680
Smallest m > 0 such that n*2^m + 1 is prime, or 0 if no such m exists.
- Start with n; iterate the process x -> ceiling(3x/2) until reach a prime. Sequence gives number of steps to reach a prime or 0 if no prime is ever reached.A078681
Start with n; iterate the process x -> ceiling(3x/2) until reach a prime. Sequence gives number of steps to reach a prime or 0 if no prime is ever reached.
- Start with n; iterate the process x -> ceiling(3x/2) until reach a prime. Sequence gives primes reached.A078682
Start with n; iterate the process x -> ceiling(3x/2) until reach a prime. Sequence gives primes reached.
- Least prime of the form n*2^m+1 for m>0, or 0 if there is no such prime.A078683
Least prime of the form n*2^m+1 for m>0, or 0 if there is no such prime.
- a(n) = 3^floor(n^2/4).A078684
a(n) = 3^floor(n^2/4).
- Minimum value of |prime(n) - 2^x|.A078685
Minimum value of |prime(n) - 2^x|.
- Primes prime(k) such that 2^k - prime(k) is also prime.A078686
Primes prime(k) such that 2^k - prime(k) is also prime.
- Number of x>=0 such that prime(n)-2^x is prime.A078687
Number of x>=0 such that prime(n)-2^x is prime.
- Continued fraction expansion of e^(1/4).A078688
Continued fraction expansion of e^(1/4).
- Continued fraction expansion of e^(1/3).A078689
Continued fraction expansion of e^(1/3).
- Continued fraction expansion of e^(2/5).A078690
Continued fraction expansion of e^(2/5).
- Numbers k such that the k-th difference between 2 successive primes equals the squarefree part of k.A078691
Numbers k such that the k-th difference between 2 successive primes equals the squarefree part of k.
- Triangle reads by rows: T(n,k) = coefficient of x^k in (x^3-2*x^2-2*x+1)^n.A078692
Triangle reads by rows: T(n,k) = coefficient of x^k in (x^3-2*x^2-2*x+1)^n.
- Largest k such that round(1/(sqrt(prime(k+1))-sqrt(prime(k)))) = n where prime(n) denotes the n-th prime (conjectured values).A078693
Largest k such that round(1/(sqrt(prime(k+1))-sqrt(prime(k)))) = n where prime(n) denotes the n-th prime (conjectured values).
- Numbers n such that floor(2*Pi*n) is prime.A078694
Numbers n such that floor(2*Pi*n) is prime.
- a(n+1) = a(n)+greatest prime divisor of a(n-1).A078695
a(n+1) = a(n)+greatest prime divisor of a(n-1).
- a(n+1)=a(n)+a(n-1) if a(n-1) odd, a(n+1)=a(n)+a(n-1)/2 if a(n-1) even.A078696
a(n+1)=a(n)+a(n-1) if a(n-1) odd, a(n+1)=a(n)+a(n-1)/2 if a(n-1) even.
- Duplicate of A066629.A078697
Duplicate of A066629.
- Number of ways to lace a shoe that has n pairs of eyelets such that each eyelet has at least one direct connection to the opposite side.A078698
Number of ways to lace a shoe that has n pairs of eyelets such that each eyelet has at least one direct connection to the opposite side.
- Primes p such that p^2-1 is a triangular number.A078699
Primes p such that p^2-1 is a triangular number.
- Number of symmetric ways to lace a shoe that has n pairs of eyelets such that each eyelet has at least one direct connection to the opposite side.A078700
Number of symmetric ways to lace a shoe that has n pairs of eyelets such that each eyelet has at least one direct connection to the opposite side.
- Least odd prime factor of n, or 1 if no such factor exists.A078701
Least odd prime factor of n, or 1 if no such factor exists.
- Number of ways to lace a shoe that has n pairs of eyelets such that each eyelet has at least one direct connection to the opposite side.A078702
Number of ways to lace a shoe that has n pairs of eyelets such that each eyelet has at least one direct connection to the opposite side.
- Number of ways of subtracting twice a triangular number from a perfect square to obtain the integer n.A078703
Number of ways of subtracting twice a triangular number from a perfect square to obtain the integer n.
- Integer part of the square root of phi(n).A078704
Integer part of the square root of phi(n).
- Integer part of the square root of sigma(n).A078705
Integer part of the square root of sigma(n).
- a(n) = smallest integer >=a(n-1) such that sum of first n terms is prime.A078706
a(n) = smallest integer >=a(n-1) such that sum of first n terms is prime.
- Number of vectors of length n that are symmetric about the middle, where each element is drawn from a set of n distinct elements.A078707
Number of vectors of length n that are symmetric about the middle, where each element is drawn from a set of n distinct elements.
- Sum of divisors d of n such that n/d is not congruent to 0 mod 3.A078708
Sum of divisors d of n such that n/d is not congruent to 0 mod 3.
- a(n) = floor(n/d(n)), where d(n) is the number of divisors of n (A000005).A078709
a(n) = floor(n/d(n)), where d(n) is the number of divisors of n (A000005).
- Integer part of the subinterval sample variance in the partition of [0,n] by the divisors of n.A078710
Integer part of the subinterval sample variance in the partition of [0,n] by the divisors of n.