Sequences
392,541 sequences
- Length of n-th run of digit 1 in A031253.A031261
Length of n-th run of digit 1 in A031253.
- Length of n-th run of digit 2 in A031253.A031262
Length of n-th run of digit 2 in A031253.
- Length of n-th run of digit 3 in A031253.A031263
Length of n-th run of digit 3 in A031253.
- Length of n-th run of digit 4 in A031253.A031264
Length of n-th run of digit 4 in A031253.
- a(n)=(# 1's)-(# 0's) in first n terms of A031253.A031265
a(n)=(# 1's)-(# 0's) in first n terms of A031253.
- a(n)=(# 1's)-(# 2's) in first n terms of A031253.A031266
a(n)=(# 1's)-(# 2's) in first n terms of A031253.
- (# 2's)-(# 3's) in first n terms of A031253.A031267
(# 2's)-(# 3's) in first n terms of A031253.
- a(n)=(# 3's)-(# 4's) in first n terms of A031253.A031268
a(n)=(# 3's)-(# 4's) in first n terms of A031253.
- Write the (n+1)st Fibonacci number in base 5 and juxtapose.A031269
Write the (n+1)st Fibonacci number in base 5 and juxtapose.
- Position of n-th 0 in A031269.A031270
Position of n-th 0 in A031269.
- Position of n-th 1 in A031269.A031271
Position of n-th 1 in A031269.
- Position of n-th 2 in A031269.A031272
Position of n-th 2 in A031269.
- Position of n-th 3 in A031269.A031273
Position of n-th 3 in A031269.
- Position of n-th 4 in A031269.A031274
Position of n-th 4 in A031269.
- a(n)=least k such that the base 5 representation of n begins at s(k), where s=A031269.A031275
a(n)=least k such that the base 5 representation of n begins at s(k), where s=A031269.
- Length of n-th run of digit 0 in A031269.A031276
Length of n-th run of digit 0 in A031269.
- Length of n-th run of digit 1 in A031269.A031277
Length of n-th run of digit 1 in A031269.
- Length of n-th run of digit 2 in A031269.A031278
Length of n-th run of digit 2 in A031269.
- Length of n-th run of digit 3 in A031269.A031279
Length of n-th run of digit 3 in A031269.
- Length of n-th run of digit 4 in A031269.A031280
Length of n-th run of digit 4 in A031269.
- a(n)=(# 1's)-(# 0's) in first n terms of A031269.A031281
a(n)=(# 1's)-(# 0's) in first n terms of A031269.
- a(n)=(# 1's)-(# 2's) in first n terms of A031269.A031282
a(n)=(# 1's)-(# 2's) in first n terms of A031269.
- a(n)=(# 2's)-(# 3's) in first n terms of A031269.A031283
a(n)=(# 2's)-(# 3's) in first n terms of A031269.
- a(n)=(# 3's)-(# 4's) in first n terms of A031269.A031284
a(n)=(# 3's)-(# 4's) in first n terms of A031269.
- The odd-greedy Egyptian-fraction algorithm for 5/1444613 has 37 terms, the last of which has 384122451172 digits; sequence gives remainder-numerators.A031285
The odd-greedy Egyptian-fraction algorithm for 5/1444613 has 37 terms, the last of which has 384122451172 digits; sequence gives remainder-numerators.
- Additive persistence: number of summations of digits needed to obtain a single digit (the additive digital root).A031286
Additive persistence: number of summations of digits needed to obtain a single digit (the additive digital root).
- Position of n-th 0 in A007376.A031287
Position of n-th 0 in A007376.
- Position of n-th 1 in A007376.A031288
Position of n-th 1 in A007376.
- Position of n-th 2 in A007376.A031289
Position of n-th 2 in A007376.
- Position of n-th 3 in A007376.A031290
Position of n-th 3 in A007376.
- Position of n-th 4 in A007376.A031291
Position of n-th 4 in A007376.
- Position of n-th 5 in A007376.A031292
Position of n-th 5 in A007376.
- Position of n-th 6 in A007376.A031293
Position of n-th 6 in A007376.
- Position of n-th 7 in A007376.A031294
Position of n-th 7 in A007376.
- Position of n-th 8 in A007376.A031295
Position of n-th 8 in A007376.
- Position of n-th 9 in A007376.A031296
Position of n-th 9 in A007376.
- a(n) is the least k such that the base-10 representation of n begins at s(k), where s=A007376.A031297
a(n) is the least k such that the base-10 representation of n begins at s(k), where s=A007376.
- Triangle T(n,k): write n in base 10, reverse order of digits.A031298
Triangle T(n,k): write n in base 10, reverse order of digits.
- Position of n-th 0 in A031298.A031299
Position of n-th 0 in A031298.
- Position of n-th 1 in A031298.A031300
Position of n-th 1 in A031298.
- Position of n-th 2 in A031298.A031301
Position of n-th 2 in A031298.
- Position of n-th 3 in A031298.A031302
Position of n-th 3 in A031298.
- Position of n-th 4 in A031298.A031303
Position of n-th 4 in A031298.
- Position of n-th 5 in A031298.A031304
Position of n-th 5 in A031298.
- Position of n-th 6 in A031298.A031305
Position of n-th 6 in A031298.
- Position of n-th 7 in A031298.A031306
Position of n-th 7 in A031298.
- Position of n-th 8 in A031298.A031307
Position of n-th 8 in A031298.
- Position of n-th 9 in A031298.A031308
Position of n-th 9 in A031298.
- a(n)=least k such that base 10 representation of n begins at s(k), where s=A031298.A031309
a(n)=least k such that base 10 representation of n begins at s(k), where s=A031298.
- Write n in base 10, complement each digit and juxtapose.A031310
Write n in base 10, complement each digit and juxtapose.