Sequences

392,541 sequences

Decimal expansion of cube root of 91.A010661
Decimal expansion of cube root of 91.
Decimal expansion of cube root of 92.A010662
Decimal expansion of cube root of 92.
Decimal expansion of cube root of 93.A010663
Decimal expansion of cube root of 93.
Decimal expansion of cube root of 94.A010664
Decimal expansion of cube root of 94.
Decimal expansion of cube root of 95.A010665
Decimal expansion of cube root of 95.
Decimal expansion of cube root of 96.A010666
Decimal expansion of cube root of 96.
Decimal expansion of cube root of 97.A010667
Decimal expansion of cube root of 97.
Decimal expansion of cube root of 98.A010668
Decimal expansion of cube root of 98.
Decimal expansion of cube root of 99.A010669
Decimal expansion of cube root of 99.
Decimal expansion of cube root of 100.A010670
Decimal expansion of cube root of 100.
Maximal size of binary code of length n correcting 4 unidirectional errors.A010671
Maximal size of binary code of length n correcting 4 unidirectional errors.
A B_2 sequence: a(n) = least value such that the sequence increases and pairwise sums of distinct terms are all distinct.A010672
A B_2 sequence: a(n) = least value such that the sequence increases and pairwise sums of distinct terms are all distinct.
Period 2: repeat [0, 2].A010673
Period 2: repeat [0, 2].
Period 2: repeat (0,3).A010674
Period 2: repeat (0,3).
Period 2: repeat (0,4).A010675
Period 2: repeat (0,4).
Period 2: repeat [0, 5].A010676
Period 2: repeat [0, 5].
Period 2: repeat (0,6).A010677
Period 2: repeat (0,6).
Period 2: repeat (0,7).A010678
Period 2: repeat (0,7).
Period 2: repeat (0,8).A010679
Period 2: repeat (0,8).
Decimal expansion of 1/11.A010680
Decimal expansion of 1/11.
Period 2: repeat (0,10).A010681
Period 2: repeat (0,10).
Erroneous version of A001003.A010682
Erroneous version of A001003.
Let S(x,y) = number of lattice paths from (0,0) to (x,y) that use the step set { (0,1), (1,0), (2,0), (3,0), ...} and never pass below y = x. Sequence gives S(n-1,n) = number of 'Schröder' trees with n+1 leaves and root of degree 2.A010683
Let S(x,y) = number of lattice paths from (0,0) to (x,y) that use the step set { (0,1), (1,0), (2,0), (3,0), ...} and never pass below y = x. Sequence gives S(n-1,n) = number of 'Schröder' trees with n+1 leaves and root of degree 2.
Period 2: repeat (1,3); offset 0.A010684
Period 2: repeat (1,3); offset 0.
Period 2: repeat (1,4).A010685
Period 2: repeat (1,4).
Periodic sequence: repeat [1, 5].A010686
Periodic sequence: repeat [1, 5].
Repeat (1,6): Period 2.A010687
Repeat (1,6): Period 2.
Period 2: repeat (1,7).A010688
Period 2: repeat (1,7).
Periodic sequence: Repeat 1, 8.A010689
Periodic sequence: Repeat 1, 8.
Period 2: repeat (1,9).A010690
Period 2: repeat (1,9).
Period 2: repeat (1,10).A010691
Period 2: repeat (1,10).
Constant sequence: a(n) = 10.A010692
Constant sequence: a(n) = 10.
Periodic sequence: Repeat 2,3.A010693
Periodic sequence: Repeat 2,3.
Period 2: repeat (2,4).A010694
Period 2: repeat (2,4).
Period 2: repeat (2,5).A010695
Period 2: repeat (2,5).
Periodic sequence: Repeat 2,6.A010696
Periodic sequence: Repeat 2,6.
Period 2: repeat (2,7).A010697
Period 2: repeat (2,7).
Period 2: repeat (2,8).A010698
Period 2: repeat (2,8).
Period 2: repeat (2,9).A010699
Period 2: repeat (2,9).
Period 2: repeat (2,10).A010700
Period 2: repeat (2,10).
Constant sequence: the all 3's sequence.A010701
Constant sequence: the all 3's sequence.
Period 2: repeat (3,4).A010702
Period 2: repeat (3,4).
Period 2: repeat (3,5).A010703
Period 2: repeat (3,5).
Period 2: repeat (3,6).A010704
Period 2: repeat (3,6).
Period 2: repeat (3,7).A010705
Period 2: repeat (3,7).
Period 2: repeat (3,8).A010706
Period 2: repeat (3,8).
Period 2: repeat (3,9).A010707
Period 2: repeat (3,9).
Period 2: repeat [3,10].A010708
Period 2: repeat [3,10].
Constant sequence: the all 4's sequence.A010709
Constant sequence: the all 4's sequence.
Period 2: repeat [4,5].A010710
Period 2: repeat [4,5].