Sequences

392,541 sequences

a(n) = T(2n,n+1), where T is the array in A026148.A026161
a(n) = T(2n,n+1), where T is the array in A026148.
a(n) = T(n,[ n/2 ]), where T is the array in A026148.A026162
a(n) = T(n,[ n/2 ]), where T is the array in A026148.
Sum{T(k,k-1)}, k = 1,2,...,n, where T is the array in A026148.A026163
Sum{T(k,k-1)}, k = 1,2,...,n, where T is the array in A026148.
a(n) = Sum{T(n,k)}, k = 0,1,...,n, where T is the array in A026148.A026164
a(n) = Sum{T(n,k)}, k = 0,1,...,n, where T is the array in A026148.
Number of (s(0), s(1), ..., s(n)) such that every s(i) is a nonnegative integer, s(0) = 2, |s(1) - s(0)| = 1, |s(i) - s(i-1)| <= 1 for i >= 2. Also sum of numbers in row n+1 of the array T in A026148.A026165
Number of (s(0), s(1), ..., s(n)) such that every s(i) is a nonnegative integer, s(0) = 2, |s(1) - s(0)| = 1, |s(i) - s(i-1)| <= 1 for i >= 2. Also sum of numbers in row n+1 of the array T in A026148.
For n >= 2, let h=floor((n-1)/2), L=n-h, R=n+h; then a(L)=n if a(L) not yet defined, otherwise a(R)=n; thus |a(n)-n| = floor((1/2)*(a(n)-1)).A026166
For n >= 2, let h=floor((n-1)/2), L=n-h, R=n+h; then a(L)=n if a(L) not yet defined, otherwise a(R)=n; thus |a(n)-n| = floor((1/2)*(a(n)-1)).
a(n) is the position of n in A026166.A026167
a(n) is the position of n in A026166.
Numbers k such that A026166(j) < A026166(k) for all j < k.A026168
Numbers k such that A026166(j) < A026166(k) for all j < k.
a(n) = s(k), where k is the n-th number k such that s(j)<s(k) for all j<k, where s = A026166.A026169
a(n) = s(k), where k is the n-th number k such that s(j)<s(k) for all j<k, where s = A026166.
Duplicate of A026138.A026170
Duplicate of A026138.
Duplicate of A026141.A026171
Duplicate of A026141.
Duplicate of A026136.A026172
Duplicate of A026136.
Duplicate of A026137.A026173
Duplicate of A026137.
Duplicate of A026138.A026174
Duplicate of A026138.
Duplicate of A026139.A026175
Duplicate of A026139.
Duplicate of A026141.A026176
Duplicate of A026141.
For n >= 2, let h=floor(n/2), L=n-h, R=n+h; then a(R)=n if n odd or a(L) already defined, otherwise a(L)=n.A026177
For n >= 2, let h=floor(n/2), L=n-h, R=n+h; then a(R)=n if n odd or a(L) already defined, otherwise a(L)=n.
a(n) is the position of n in A026177.A026178
a(n) is the position of n in A026177.
Numbers k such that A026177(j) < A026177(k) for all j < k.A026179
Numbers k such that A026177(j) < A026177(k) for all j < k.
a(n) = s(k), where k is the n-th number such that s(j)<s(k) for all j<k, where s = A026177.A026180
a(n) = s(k), where k is the n-th number such that s(j)<s(k) for all j<k, where s = A026177.
a(n) = (1/2)*(s(n) - s(n-1)), where s = A026180.A026181
a(n) = (1/2)*(s(n) - s(n-1)), where s = A026180.
a(n) = (1/2)*(s(n) + 1), where s(n) is the n-th odd number in A026136.A026182
a(n) = (1/2)*(s(n) + 1), where s(n) is the n-th odd number in A026136.
Position of n in A026182.A026183
Position of n in A026182.
a(n) = (1/3)*s(n), where s(n) is the n-th multiple of 3 in A026136.A026184
a(n) = (1/3)*s(n), where s(n) is the n-th multiple of 3 in A026136.
If n even, then 2n. If n odd, then nearest integer to 2n/3.A026185
If n even, then 2n. If n odd, then nearest integer to 2n/3.
Duplicate of A026136.A026186
Duplicate of A026136.
Duplicate of A026137.A026187
Duplicate of A026137.
a(n) = (1/5)*s(n), where s(n) is the n-th multiple of 5 in A026136.A026188
a(n) = (1/5)*s(n), where s(n) is the n-th multiple of 5 in A026136.
Position of n in A026188.A026189
Position of n in A026188.
a(n) = (1/2)*s(n), where s(n) is the n-th even number in A026142.A026190
a(n) = (1/2)*s(n), where s(n) is the n-th even number in A026142.
Position of n in A026190.A026191
Position of n in A026190.
(1/3)*s(n), where s(n) is the n-th multiple of 3 in A026142.A026192
(1/3)*s(n), where s(n) is the n-th multiple of 3 in A026142.
a(n) = position of n in A026192.A026193
a(n) = position of n in A026192.
a(n) = (1/4)*s(n), where s(n) is the n-th multiple of 4 in A026142.A026194
a(n) = (1/4)*s(n), where s(n) is the n-th multiple of 4 in A026142.
a(n) = position of n in A026194.A026195
a(n) = position of n in A026194.
Duplicate of A026177.A026196
Duplicate of A026177.
Duplicate of A026178.A026197
Duplicate of A026178.
Duplicate of A026182.A026198
Duplicate of A026182.
Duplicate of A026183.A026199
Duplicate of A026183.
a(n) = (s(n) + 2)/3, where s(n) is the n-th number congruent to 1 mod 3 in A026166.A026200
a(n) = (s(n) + 2)/3, where s(n) is the n-th number congruent to 1 mod 3 in A026166.
Position of n in A026200.A026201
Position of n in A026200.
a(n) = (1/4)*s(n), where s(n) is the n-th multiple of 4 in A026166.A026202
a(n) = (1/4)*s(n), where s(n) is the n-th multiple of 4 in A026166.
position of n in A026202.A026203
position of n in A026202.
a(n) = (1/5)*s(n), where s(n) is the n-th multiple of 5 in A026166.A026204
a(n) = (1/5)*s(n), where s(n) is the n-th multiple of 5 in A026166.
a(n) = position of n in A026204.A026205
a(n) = position of n in A026204.
Duplicate of A026182.A026206
Duplicate of A026182.
Duplicate of A026183.A026207
Duplicate of A026183.
Duplicate of A026184.A026208
Duplicate of A026184.
Duplicate of A026185.A026209
Duplicate of A026185.
Duplicate of A026136.A026210
Duplicate of A026136.