Sequences
392,541 sequences
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 2.A050061
a(n) = a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 2.
- a(n) = a(n-1)+a(m), where m=n-1-2^p and 2^p<n-1<=2^(p+1), for n >= 4.A050062
a(n) = a(n-1)+a(m), where m=n-1-2^p and 2^p<n-1<=2^(p+1), for n >= 4.
- a(n)=a(n-1)+a(m), where m=2n-2-2^(p+1) and 2^p<n-1<=2^(p+1), for n >= 4.A050063
a(n)=a(n-1)+a(m), where m=2n-2-2^(p+1) and 2^p<n-1<=2^(p+1), for n >= 4.
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 3.A050064
a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 3.
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 3.A050065
a(n) = a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 3.
- a(n) = a(n-1) + a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 3.A050066
a(n) = a(n-1) + a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 3.
- a(n)=a(n-1)+a(m), where m=2n-2-2^(p+1) and 2^p<n-1<=2^(p+1), for n >= 4.A050067
a(n)=a(n-1)+a(m), where m=2n-2-2^(p+1) and 2^p<n-1<=2^(p+1), for n >= 4.
- a(n) = a(n-1) + a(m) for n >= 3, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = 3.A050068
a(n) = a(n-1) + a(m) for n >= 3, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = 3.
- a(n) = a(n-1) + a(m) for n >= 3, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = 3.A050069
a(n) = a(n-1) + a(m) for n >= 3, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = 3.
- a(n) = a(n-1)+a(m), where m=n-1-2^p and 2^p<n-1<=2^(p+1), for m >= 4.A050070
a(n) = a(n-1)+a(m), where m=n-1-2^p and 2^p<n-1<=2^(p+1), for m >= 4.
- a(n) = a(n-1)+a(m), where m=2n-2-2^(p+1) and 2^p<n-1<=2^(p+1), for n >= 4.A050071
a(n) = a(n-1)+a(m), where m=2n-2-2^(p+1) and 2^p<n-1<=2^(p+1), for n >= 4.
- a(n) = |a(n-1) - a(m)| for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = a(3) = 1.A050072
a(n) = |a(n-1) - a(m)| for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = a(3) = 1.
- a(n) = |a(n-1) - a(m)| for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = a(3) = 1.A050073
a(n) = |a(n-1) - a(m)| for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = a(3) = 1.
- a(n) = |a(n-1) - a(m)| for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 3.A050074
a(n) = |a(n-1) - a(m)| for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 3.
- a(n) = |a(n-1) - a(m)| for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 3.A050075
a(n) = |a(n-1) - a(m)| for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 3.
- a(n) = floor(a(n-1)/3) if this is not among 0, a(1), ..., a(n-2); otherwise a(n) = 2*a(n-1).A050076
a(n) = floor(a(n-1)/3) if this is not among 0, a(1), ..., a(n-2); otherwise a(n) = 2*a(n-1).
- a(n)=position of n in A050076.A050077
a(n)=position of n in A050076.
- Numbers k such that A050076(k) < A050076(k+1).A050078
Numbers k such that A050076(k) < A050076(k+1).
- Numbers k such that A050076(k) > A050076(k+1).A050079
Numbers k such that A050076(k) > A050076(k+1).
- a(n) = floor(a(n-1)/3) if this is not among 0, a(1), ..., a(n-2); otherwise a(n) = 4*a(n-1).A050080
a(n) = floor(a(n-1)/3) if this is not among 0, a(1), ..., a(n-2); otherwise a(n) = 4*a(n-1).
- a(n)=position of n in A050080.A050081
a(n)=position of n in A050080.
- Numbers k such that A050080(k) < A050080(k+1).A050082
Numbers k such that A050080(k) < A050080(k+1).
- Numbers k such that A050080(k) > A050080(k+1).A050083
Numbers k such that A050080(k) > A050080(k+1).
- a(n) = floor(a(n-1)/3) if this is not among 0, a(1), ..., a(n-2); otherwise a(n) = 5*a(n-1).A050084
a(n) = floor(a(n-1)/3) if this is not among 0, a(1), ..., a(n-2); otherwise a(n) = 5*a(n-1).
- a(n)=position of n in A050084.A050085
a(n)=position of n in A050084.
- Numbers k such that A050084(k) < A050084(k+1).A050086
Numbers k such that A050084(k) < A050084(k+1).
- Numbers k such that A050084(k) > A050084(k+1).A050087
Numbers k such that A050084(k) > A050084(k+1).
- a(n) = floor(a(n-1)/3) if this is positive and not yet in the sequence, otherwise a(n) = 6*a(n-1).A050088
a(n) = floor(a(n-1)/3) if this is positive and not yet in the sequence, otherwise a(n) = 6*a(n-1).
- a(n) = position of n in A050088.A050089
a(n) = position of n in A050088.
- Numbers k such that b(k) < b(k+1), where b=A050088.A050090
Numbers k such that b(k) < b(k+1), where b=A050088.
- Numbers k such that A050088(k) > A050088(k+1).A050091
Numbers k such that A050088(k) > A050088(k+1).
- a(n) = floor(a(n-1)/3) if this is positive and not yet in the sequence, otherwise a(n) = 7*a(n-1).A050092
a(n) = floor(a(n-1)/3) if this is positive and not yet in the sequence, otherwise a(n) = 7*a(n-1).
- a(n)=position of n in A050092.A050093
a(n)=position of n in A050092.
- Numbers k such that A050092(k) < A050092(k+1).A050094
Numbers k such that A050092(k) < A050092(k+1).
- Numbers k such that A050092(k) > A050092(k+1).A050095
Numbers k such that A050092(k) > A050092(k+1).
- a(n) = floor(a(n-1)/3) if this is positive and not yet in the sequence, otherwise a(n) = 8*a(n-1).A050096
a(n) = floor(a(n-1)/3) if this is positive and not yet in the sequence, otherwise a(n) = 8*a(n-1).
- a(n)=position of n in A050096.A050097
a(n)=position of n in A050096.
- Numbers k such that A050096(k) < A050096(k+1).A050098
Numbers k such that A050096(k) < A050096(k+1).
- Numbers k such that A050096(k) > A050096(k+1).A050099
Numbers k such that A050096(k) > A050096(k+1).
- a(n) = floor(a(n-1)/3) if this is positive and not yet in the sequence, otherwise a(n) = 10*a(n-1).A050100
a(n) = floor(a(n-1)/3) if this is positive and not yet in the sequence, otherwise a(n) = 10*a(n-1).
- a(n) is the position of n in A050100.A050101
a(n) is the position of n in A050100.
- Numbers k such that A050100(k) < A050100(k+1).A050102
Numbers k such that A050100(k) < A050100(k+1).
- Numbers k such that A050100(k) > A050100(k+1).A050103
Numbers k such that A050100(k) > A050100(k+1).
- a(n) = floor(a(n-1)/4) if this is not among 0, a(1), ..., a(n-2); otherwise a(n) = 3*a(n-1).A050104
a(n) = floor(a(n-1)/4) if this is not among 0, a(1), ..., a(n-2); otherwise a(n) = 3*a(n-1).
- a(n)=position of n in A050104.A050105
a(n)=position of n in A050104.
- Numbers k such that A050104(k) < A050104(k+1).A050106
Numbers k such that A050104(k) < A050104(k+1).
- Numbers k such that A050104(k) > A050104(k+1).A050107
Numbers k such that A050104(k) > A050104(k+1).
- a(n) = floor(a(n-1)/4) if this is positive and not yet in the sequence, otherwise a(n) = 5*a(n-1).A050108
a(n) = floor(a(n-1)/4) if this is positive and not yet in the sequence, otherwise a(n) = 5*a(n-1).
- a(n)=position of n in A050108.A050109
a(n)=position of n in A050108.
- Numbers k such that A050108(k) < A050108(k+1).A050110
Numbers k such that A050108(k) < A050108(k+1).