Sequences
392,541 sequences
- Same as A094858, except that we fix X = 123123123...A094861
Same as A094858, except that we fix X = 123123123...
- Same as A094858, except that we fix X = 123412341234...A094862
Same as A094858, except that we fix X = 123412341234...
- Maximal number of longest common subsequences between any two strings of length n (Version 2).A094863
Maximal number of longest common subsequences between any two strings of length n (Version 2).
- a(0)=1, a(1)=2, a(2)=6, a(3)=18; for n >= 4, a(n) = 6*a(n-1) - 11*a(n-2) + 6*a(n-3) - a(n-4).A094864
a(0)=1, a(1)=2, a(2)=6, a(3)=18; for n >= 4, a(n) = 6*a(n-1) - 11*a(n-2) + 6*a(n-3) - a(n-4).
- Expansion of x^3/((1-3*x+x^2)*(1-5*x+5*x^2)).A094865
Expansion of x^3/((1-3*x+x^2)*(1-5*x+5*x^2)).
- Number of truncated ST-pairs O(q^n).A094866
Number of truncated ST-pairs O(q^n).
- Number of iterations of the LQTL cellular automaton required to generate a square of cells in identical states.A094867
Number of iterations of the LQTL cellular automaton required to generate a square of cells in identical states.
- Decimal expansion of e/phi, where phi is the golden ratio (A001622).A094868
Decimal expansion of e/phi, where phi is the golden ratio (A001622).
- E.g.f.: exp(5x)/(1-5x)^(1/5).A094869
E.g.f.: exp(5x)/(1-5x)^(1/5).
- a(1)=1; for n > 1, a(n) is the minimal positive integer t not equal to a(1), ..., a(n-1) such that t - a(n-i) is not equal to a(n-i) - a(n-2i) for all 1 <= i < n/2.A094870
a(1)=1; for n > 1, a(n) is the minimal positive integer t not equal to a(1), ..., a(n-1) such that t - a(n-i) is not equal to a(n-i) - a(n-2i) for all 1 <= i < n/2.
- Let 2/(2n+1) = 1/i + 1/j + 1/k + ... with i < j < k < ... be the ancient Egyptian way of writing this fraction; sequence gives value of i.A094871
Let 2/(2n+1) = 1/i + 1/j + 1/k + ... with i < j < k < ... be the ancient Egyptian way of writing this fraction; sequence gives value of i.
- phi(n)/tau(n), for odd squarefree n > 1 (A056911), phi = A000010, tau = A000005.A094872
phi(n)/tau(n), for odd squarefree n > 1 (A056911), phi = A000010, tau = A000005.
- n! has a triangular number of digits.A094873
n! has a triangular number of digits.
- Decimal expansion of (5-sqrt(5))/2.A094874
Decimal expansion of (5-sqrt(5))/2.
- Numbers k such that floor(10^k * Pi) is prime.A094875
Numbers k such that floor(10^k * Pi) is prime.
- a(1) = a(2) = a(3) = a(4) = a(5) = a(6) = 1; then a(n) = sum( a(2*i)*a(3*j)) where 1< = i< = n, 1< = j< = n and 2*i+3*j = n.A094876
a(1) = a(2) = a(3) = a(4) = a(5) = a(6) = 1; then a(n) = sum( a(2*i)*a(3*j)) where 1< = i< = n, 1< = j< = n and 2*i+3*j = n.
- Primes that are reached in A094830.A094877
Primes that are reached in A094830.
- n sets a new record in A094830.A094878
n sets a new record in A094830.
- Where 1's occur in A094830 (nonprimes that reach a prime in one step under iteration of "x -> x + sum of squares of digits of x").A094879
Where 1's occur in A094830 (nonprimes that reach a prime in one step under iteration of "x -> x + sum of squares of digits of x").
- Decimal expansion of phi/e, where phi = (1+sqrt(5))/2.A094880
Decimal expansion of phi/e, where phi = (1+sqrt(5))/2.
- Decimal expansion of Pi/phi, where phi = (1+sqrt(5))/2.A094881
Decimal expansion of Pi/phi, where phi = (1+sqrt(5))/2.
- Decimal expansion of phi/Pi, where phi = (1+sqrt(5))/2.A094882
Decimal expansion of phi/Pi, where phi = (1+sqrt(5))/2.
- Decimal expansion of sqrt(2)/phi, where phi = (1+sqrt(5))/2.A094883
Decimal expansion of sqrt(2)/phi, where phi = (1+sqrt(5))/2.
- Decimal expansion of phi/sqrt(2), where phi = (1+sqrt(5))/2.A094884
Decimal expansion of phi/sqrt(2), where phi = (1+sqrt(5))/2.
- Decimal expansion of phi*e, where phi = (1 + sqrt(5))/2.A094885
Decimal expansion of phi*e, where phi = (1 + sqrt(5))/2.
- Decimal expansion of phi*Pi, where phi = (1+sqrt(5))/2.A094886
Decimal expansion of phi*Pi, where phi = (1+sqrt(5))/2.
- Decimal expansion of phi*sqrt(2), where phi = (1+sqrt(5))/2.A094887
Decimal expansion of phi*sqrt(2), where phi = (1+sqrt(5))/2.
- Decimal expansion of 2*Pi*phi, where phi = (1+sqrt(5))/2.A094888
Decimal expansion of 2*Pi*phi, where phi = (1+sqrt(5))/2.
- Odd nonunitary abundant numbers.A094889
Odd nonunitary abundant numbers.
- Triangular numbers whose sum of squared digits is also triangular.A094890
Triangular numbers whose sum of squared digits is also triangular.
- Total area below the lattice paths of a given length defined by the rule [(0),(k)->(k-1)(k)(k+1)] (Motzkin paths).A094891
Total area below the lattice paths of a given length defined by the rule [(0),(k)->(k-1)(k)(k+1)] (Motzkin paths).
- a(n) is the number of primes between n*210 and (n+1)*210.A094892
a(n) is the number of primes between n*210 and (n+1)*210.
- Total area below the lattice paths of length n defined by the rule [(0),(k)->(k-1)(k+1)] (Dyck paths).A094893
Total area below the lattice paths of length n defined by the rule [(0),(k)->(k-1)(k+1)] (Dyck paths).
- a(n) = prime(Lucas(n)), Lucas numbers beginning at 2 (A000032).A094894
a(n) = prime(Lucas(n)), Lucas numbers beginning at 2 (A000032).
- Sequence generated from a Knight's tour of a 4 X 4 chessboard considered as a matrix.A094895
Sequence generated from a Knight's tour of a 4 X 4 chessboard considered as a matrix.
- If 4*n+1 is prime and 4*n+3 is not prime then a(n)=4*n+1, else a(n)=0.A094896
If 4*n+1 is prime and 4*n+3 is not prime then a(n)=4*n+1, else a(n)=0.
- If 4*n+1 is not prime and 4*n+3 is prime then a(n)=4*n+3, else a(n)=0.A094897
If 4*n+1 is not prime and 4*n+3 is prime then a(n)=4*n+3, else a(n)=0.
- This sequence needs a proper name.A094898
This sequence needs a proper name.
- a(n) = Floor[Exp[(Prime[n]-n*Log[3])/n]].A094899
a(n) = Floor[Exp[(Prime[n]-n*Log[3])/n]].
- a(n) = floor( prime(n-1)*A036263(n-2)/ A001223(n-1)).A094900
a(n) = floor( prime(n-1)*A036263(n-2)/ A001223(n-1)).
- Positive integer values of the integer Schwarzian derivatives of the primes.A094901
Positive integer values of the integer Schwarzian derivatives of the primes.
- Average of four primes that have nonnegative integer Schwartzian derivative.A094902
Average of four primes that have nonnegative integer Schwartzian derivative.
- Average of 4 primes where the integer Schwarzian derivative is zero.A094903
Average of 4 primes where the integer Schwarzian derivative is zero.
- Least hypotenuse of primitive Pythagorean triangles exceeding a leg by A096033(n).A094904
Least hypotenuse of primitive Pythagorean triangles exceeding a leg by A096033(n).
- Expansion of e.g.f.: exp(6*x)/(1-6*x)^(1/6).A094905
Expansion of e.g.f.: exp(6*x)/(1-6*x)^(1/6).
- Numbers m such that m^3-k^3 is a square for some k<m.A094906
Numbers m such that m^3-k^3 is a square for some k<m.
- Number of different nontrivial two-digit cancellations of the form (xy)/(zx) = y/z in base n.A094907
Number of different nontrivial two-digit cancellations of the form (xy)/(zx) = y/z in base n.
- Numbers n such that A001414(n) = sum of squared digits of n.A094908
Numbers n such that A001414(n) = sum of squared digits of n.
- Let p_k(n) = number of partitions of n into exactly k parts; sequence gives p_3(n-3) + p_2(n-2) + 1.A094909
Let p_k(n) = number of partitions of n into exactly k parts; sequence gives p_3(n-3) + p_2(n-2) + 1.
- Initial member of two consecutive prime sextuples with the smallest possible difference 210 (not considering the first two prime sextuples, whose difference is 90).A094910
Initial member of two consecutive prime sextuples with the smallest possible difference 210 (not considering the first two prime sextuples, whose difference is 90).