Sequences
392,541 sequences
- Number of potential flows in n X n array with integer velocities in -14..14, i.e., number of n X n arrays with adjacent elements differing by no more than 14, counting arrays differing by a constant only once.A068761
Number of potential flows in n X n array with integer velocities in -14..14, i.e., number of n X n arrays with adjacent elements differing by no more than 14, counting arrays differing by a constant only once.
- Alternating sum sigma(1)-sigma(2)+sigma(3)-sigma(4)+...+((-1)^(n+1))*sigma(n).A068762
Alternating sum sigma(1)-sigma(2)+sigma(3)-sigma(4)+...+((-1)^(n+1))*sigma(n).
- Irregular triangle of the Fibonacci polynomials of A011973 multiplied diagonally by the Catalan numbers.A068763
Irregular triangle of the Fibonacci polynomials of A011973 multiplied diagonally by the Catalan numbers.
- Generalized Catalan numbers 2*x*A(x)^2 -A(x) +1 -x =0.A068764
Generalized Catalan numbers 2*x*A(x)^2 -A(x) +1 -x =0.
- Generalized Catalan numbers 3*x*A(x)^2 -A(x) +1 -2*x = 0.A068765
Generalized Catalan numbers 3*x*A(x)^2 -A(x) +1 -2*x = 0.
- Generalized Catalan numbers 4*x*A(x)^2 -A(x)+1-3*x=0.A068766
Generalized Catalan numbers 4*x*A(x)^2 -A(x)+1-3*x=0.
- Generalized Catalan numbers 5*x*A(x)^2 -A(x) +1 -4*x=0.A068767
Generalized Catalan numbers 5*x*A(x)^2 -A(x) +1 -4*x=0.
- Generalized Catalan numbers 6*x*A(x)^2 -A(x) +1 -5*x =0.A068768
Generalized Catalan numbers 6*x*A(x)^2 -A(x) +1 -5*x =0.
- Generalized Catalan numbers 7*x*A(x)^2 -A(x) +1 -6*x=0.A068769
Generalized Catalan numbers 7*x*A(x)^2 -A(x) +1 -6*x=0.
- Generalized Catalan numbers 8*x*A(x)^2 -A(x) +1 -7*x=0.A068770
Generalized Catalan numbers 8*x*A(x)^2 -A(x) +1 -7*x=0.
- Generalized Catalan numbers 9*x*A(x)^2 -A(x) +1 -8*x=0.A068771
Generalized Catalan numbers 9*x*A(x)^2 -A(x) +1 -8*x=0.
- Generalized Catalan numbers 10*x*A(x)^2 -A(x) +1 -9*x =0.A068772
Generalized Catalan numbers 10*x*A(x)^2 -A(x) +1 -9*x =0.
- Alternating sum phi(1) - phi(2) + phi(3) - phi(4) + ... + ((-1)^(n+1))*phi(n).A068773
Alternating sum phi(1) - phi(2) + phi(3) - phi(4) + ... + ((-1)^(n+1))*phi(n).
- Number of strings over Z_4 of length n with trace 0 and subtrace 2.A068774
Number of strings over Z_4 of length n with trace 0 and subtrace 2.
- Duplicate of A068774.A068775
Duplicate of A068774.
- a(0) = 1; for n > 0, a(n) is the smallest triangular number which is a (proper) multiple of a(n-1).A068776
a(0) = 1; for n > 0, a(n) is the smallest triangular number which is a (proper) multiple of a(n-1).
- S(n; 0,3) = S(n; 2,1) where S(n; t,s) is the number of length n 4-ary strings whose digits sum to t mod 4 and whose sum of products of all pairs of digits sum to s mod 4.A068777
S(n; 0,3) = S(n; 2,1) where S(n; t,s) is the number of length n 4-ary strings whose digits sum to t mod 4 and whose sum of products of all pairs of digits sum to s mod 4.
- S(n; 1,1) = S(n; 3,1) where S(n; t,s) is the number of length n 4-ary strings whose digits sum to t mod 4 and whose sum of products of all pairs of digits sum to s mod 4.A068778
S(n; 1,1) = S(n; 3,1) where S(n; t,s) is the number of length n 4-ary strings whose digits sum to t mod 4 and whose sum of products of all pairs of digits sum to s mod 4.
- Least number k such that floor( k / digit reversal of k ) = n.A068779
Least number k such that floor( k / digit reversal of k ) = n.
- Composite numbers n such that n+1 is also composite.A068780
Composite numbers n such that n+1 is also composite.
- Lesser of two consecutive numbers each divisible by a square.A068781
Lesser of two consecutive numbers each divisible by a square.
- Lesser of two consecutive numbers each divisible by a fourth power.A068782
Lesser of two consecutive numbers each divisible by a fourth power.
- Lesser of two consecutive numbers each divisible by a fifth power.A068783
Lesser of two consecutive numbers each divisible by a fifth power.
- Lesser of two consecutive numbers each divisible by a sixth power.A068784
Lesser of two consecutive numbers each divisible by a sixth power.
- Number of Cartesian lattice points in or on the circle x^2 + y^2 = 10^n.A068785
Number of Cartesian lattice points in or on the circle x^2 + y^2 = 10^n.
- S(n; 1,0) = S(n; 3,0) where S(n; t,s) is the number of length n 4-ary strings whose digits sum to t mod 4 and whose sum of products of all pairs of digits sum to s mod 4.A068786
S(n; 1,0) = S(n; 3,0) where S(n; t,s) is the number of length n 4-ary strings whose digits sum to t mod 4 and whose sum of products of all pairs of digits sum to s mod 4.
- Number of strings over Z_4 of length n with trace 1 and subtrace 2.A068787
Number of strings over Z_4 of length n with trace 1 and subtrace 2.
- S(n; 1,3) = S(n; 3,3) where S(n; t,s) is the number of length n 4-ary strings whose digits sum to t mod 4 and whose sum of products of all pairs of digits sum to s mod 4.A068788
S(n; 1,3) = S(n; 3,3) where S(n; t,s) is the number of length n 4-ary strings whose digits sum to t mod 4 and whose sum of products of all pairs of digits sum to s mod 4.
- S(n; 2,0) where S(n; t,s) is the number of length n 4-ary strings whose digits sum to t mod 4 and whose sum of products of all pairs of digits sum to s mod 4.A068789
S(n; 2,0) where S(n; t,s) is the number of length n 4-ary strings whose digits sum to t mod 4 and whose sum of products of all pairs of digits sum to s mod 4.
- Number of strings over Z_4 of length n with trace 2 and subtrace 2.A068790
Number of strings over Z_4 of length n with trace 2 and subtrace 2.
- Ulam numbers such that 2*n is also an Ulam number.A068791
Ulam numbers such that 2*n is also an Ulam number.
- a(n) = (n-1)*n^(n-2) + Sum_{i=1..n} (n-i)*(n^(n-i-1) + n^(n+i-3)).A068792
a(n) = (n-1)*n^(n-2) + Sum_{i=1..n} (n-i)*(n^(n-i-1) + n^(n+i-3)).
- a(n) = Sum_{i=1..n} i*(n^(n-i-1) + n^(n+i-1)).A068793
a(n) = Sum_{i=1..n} i*(n^(n-i-1) + n^(n+i-1)).
- In prime factorization of n replace all primes with the least prime factor of n; a(1)=1.A068794
In prime factorization of n replace all primes with the least prime factor of n; a(1)=1.
- In prime factorization of n replace all primes with the greatest prime factor of n; a(1)=1.A068795
In prime factorization of n replace all primes with the greatest prime factor of n; a(1)=1.
- Maximum k such that k consecutive integers starting at n have distinct numbers of prime factors (counted with multiplicity).A068796
Maximum k such that k consecutive integers starting at n have distinct numbers of prime factors (counted with multiplicity).
- Minimum x such that f(x)=n, where f(x)=A068796(x) is the maximum k such that k consecutive integers starting at x have distinct numbers of prime factors (counted with multiplicity).A068797
Minimum x such that f(x)=n, where f(x)=A068796(x) is the maximum k such that k consecutive integers starting at x have distinct numbers of prime factors (counted with multiplicity).
- Integers n such that n = A067030(j) for some j and A067286(j) < A067034(j).A068798
Integers n such that n = A067030(j) for some j and A067286(j) < A067034(j).
- Ulam numbers such that n/2 is also an Ulam number.A068799
Ulam numbers such that n/2 is also an Ulam number.
- The next new gap between successive Ulam numbers.A068800
The next new gap between successive Ulam numbers.
- Primes that can be formed by concatenating 2^a and 3^b.A068801
Primes that can be formed by concatenating 2^a and 3^b.
- Smaller of two consecutive squares which have no common digits.A068802
Smaller of two consecutive squares which have no common digits.
- Smaller of two consecutive primes which have no common digits.A068803
Smaller of two consecutive primes which have no common digits.
- Triangular numbers whose digits can be rearranged to form a substring of 123456789012345678901234....A068804
Triangular numbers whose digits can be rearranged to form a substring of 123456789012345678901234....
- Suppose the integer m has k decimal digits; make a list of the k! strings obtained by permuting the digits in all possible ways; discard any leading zeros; count distinct squares in the list (A062892); a(n) = smallest m that yields n squares.A068805
Suppose the integer m has k decimal digits; make a list of the k! strings obtained by permuting the digits in all possible ways; discard any leading zeros; count distinct squares in the list (A062892); a(n) = smallest m that yields n squares.
- Ulam numbers that are powers of 2.A068806
Ulam numbers that are powers of 2.
- Primes whose sum of digits is a power of 2.A068807
Primes whose sum of digits is a power of 2.
- Triangular numbers with strictly increasing sum of digits.A068808
Triangular numbers with strictly increasing sum of digits.
- Squares with strictly increasing sum of digits.A068809
Squares with strictly increasing sum of digits.
- Numbers n such that n and its 10's complement are both squares, i.e., n and 10^k - n (where k is the number of digits in n) are squares.A068810
Numbers n such that n and its 10's complement are both squares, i.e., n and 10^k - n (where k is the number of digits in n) are squares.