Sequences

392,541 sequences

Triangle of coefficients in a Fibonacci-like sequence of polynomials.A039961
Triangle of coefficients in a Fibonacci-like sequence of polynomials.
Duplicate of A046741.A039962
Duplicate of A046741.
The period-doubling sequence A035263 repeated.A039963
The period-doubling sequence A035263 repeated.
Motzkin numbers A001006 read mod 3.A039964
Motzkin numbers A001006 read mod 3.
An example of a d-perfect sequence.A039965
An example of a d-perfect sequence.
a(0) = 1; thereafter a(3n+2) = 0, a(3n) = a(3n+1) = a(n).A039966
a(0) = 1; thereafter a(3n+2) = 0, a(3n) = a(3n+1) = a(n).
Duplicate of A039969.A039967
Duplicate of A039969.
An example of a d-perfect sequence.A039968
An example of a d-perfect sequence.
An example of a d-perfect sequence: a(n) = Catalan(n) mod 3.A039969
An example of a d-perfect sequence: a(n) = Catalan(n) mod 3.
An example of a d-perfect sequence: a(2*n) = 0, a(2*n+1) = Catalan(n) mod 3.A039970
An example of a d-perfect sequence: a(2*n) = 0, a(2*n+1) = Catalan(n) mod 3.
An example of a d-perfect sequence.A039971
An example of a d-perfect sequence.
An example of a d-perfect sequence: a(n) = A007317(n) mod 3.A039972
An example of a d-perfect sequence: a(n) = A007317(n) mod 3.
An example of a d-perfect sequence: a(2*n) = 0, a(2*n-1) = A039965(n).A039973
An example of a d-perfect sequence: a(2*n) = 0, a(2*n-1) = A039965(n).
An example of a d-perfect sequence.A039974
An example of a d-perfect sequence.
An example of a d-perfect sequence: a(n) = A006318(n-1) mod 3.A039975
An example of a d-perfect sequence: a(n) = A006318(n-1) mod 3.
An example of a d-perfect sequence.A039976
An example of a d-perfect sequence.
An example of a d-perfect sequence.A039977
An example of a d-perfect sequence.
An example of a d-perfect sequence.A039978
An example of a d-perfect sequence.
An example of a d-perfect sequence.A039979
An example of a d-perfect sequence.
An example of a d-perfect sequence.A039980
An example of a d-perfect sequence.
An example of a d-perfect sequence.A039981
An example of a d-perfect sequence.
Let phi denote the morphism 0 -> 11, 1 -> 10. This sequence is the limit S(oo) where S(0) = 1; S(n+1) = 1.phi(S(n)).A039982
Let phi denote the morphism 0 -> 11, 1 -> 10. This sequence is the limit S(oo) where S(0) = 1; S(n+1) = 1.phi(S(n)).
An example of a d-perfect sequence.A039983
An example of a d-perfect sequence.
An example of a d-perfect sequence.A039984
An example of a d-perfect sequence.
An example of a d-perfect sequence.A039985
An example of a d-perfect sequence.
Primes such that every distinct permutation of digits is composite (including permutations with leading zeros).A039986
Primes such that every distinct permutation of digits is composite (including permutations with leading zeros).
k th digit of a(n) = number of different digits within 2 places of k (not including k).A039987
k th digit of a(n) = number of different digits within 2 places of k (not including k).
k th digit of a(n) is the number of different digits within 1 of k (not including k).A039988
k th digit of a(n) is the number of different digits within 1 of k (not including k).
k th digit of a(n) is the number of different digits within 3 of k (not including k).A039989
k th digit of a(n) is the number of different digits within 3 of k (not including k).
k th digit of a(n) is the number of different digits within 4 of k (not including k).A039990
k th digit of a(n) is the number of different digits within 4 of k (not including k).
Triangle of coefficients of cos(x)^n in polynomial for cos(nx).A039991
Triangle of coefficients of cos(x)^n in polynomial for cos(nx).
Number of distinct primes embedded in prime p(n).A039992
Number of distinct primes embedded in prime p(n).
Number of different primes embedded in n.A039993
Number of different primes embedded in n.
Number of primes embedded in decimal expansion of prime(n) as substrings.A039994
Number of primes embedded in decimal expansion of prime(n) as substrings.
Number of distinct primes which occur as subsequences of the sequence of digits of n.A039995
Number of distinct primes which occur as subsequences of the sequence of digits of n.
Number of distinct primes embedded in prime(n) as substrings.A039996
Number of distinct primes embedded in prime(n) as substrings.
Number of distinct primes which occur as substrings of the digits of n.A039997
Number of distinct primes which occur as substrings of the digits of n.
Primes embedded in prime(n).A039998
Primes embedded in prime(n).
Number of permutations of digits of n which yield distinct primes.A039999
Number of permutations of digits of n which yield distinct primes.
a(0)=1; a(n)=2 for n >= 1.A040000
a(0)=1; a(n)=2 for n >= 1.
1 followed by {1, 2} repeated.A040001
1 followed by {1, 2} repeated.
Continued fraction for sqrt(5).A040002
Continued fraction for sqrt(5).
Continued fraction for sqrt(6).A040003
Continued fraction for sqrt(6).
a(n) = smallest integer s such that for all i, all primes p and all m the congruence (x_1)^n + ... + (x_s)^n == m (mod p^i) has a primitive solution.A040004
a(n) = smallest integer s such that for all i, all primes p and all m the congruence (x_1)^n + ... + (x_s)^n == m (mod p^i) has a primitive solution.
Continued fraction for sqrt(8).A040005
Continued fraction for sqrt(8).
Continued fraction for sqrt(10).A040006
Continued fraction for sqrt(10).
Continued fraction for sqrt(11).A040007
Continued fraction for sqrt(11).
Continued fraction for sqrt(12).A040008
Continued fraction for sqrt(12).
Decimal expansion of Pi*exp(-Pi^2/2).A040009
Decimal expansion of Pi*exp(-Pi^2/2).
Continued fraction for Pi*exp(-Pi^2/2).A040010
Continued fraction for Pi*exp(-Pi^2/2).