A019586 -id:A019586 - cp's OEIS frontend

A098861 a(n) = row number in Stolarsky array that contains n. If the first occurrence of a number in the sequence is deleted, the sequence remains unchanged.

0, 0, 0, 1, 0, 1, 2, 0, 3, 1, 2, 4, 0, 5, 3, 1, 6, 2, 4, 7, 0, 8, 5, 3, 9, 1, 10, 6, 2, 11, 4, 7, 12, 0, 13, 8, 5, 14, 3, 9, 15, 1, 16, 10, 6, 17, 2, 18, 11, 4, 19, 7, 12, 20, 0

Offset: 1

Casey Mongoven, Oct 12 2004; corrected May 02 2005

nonn

The Stolarsky array is given in A035506: row 0 are the positive Fibonacci numbers; row 1 (resp. 3) are twice (resp. 3 times) these numbers, starting with 4 (resp. 9); row 2 starts 7,11,18,... etc. - M. F. Hasler, Nov 05 2014

D. R. Morrison, A Stolarsky Array of Wythoff Pairs, A Collection of Manuscripts Related to the Fibonacci Sequence, edited by V. E. Hoggatt Jr., M. Bicknell-Johnson, published by The Fibonacci Association, (1980) pp. 134-136.

Ron Knott, General Fibonacci Series
Casey Mongoven, Fibonacci Stolarsky Vertical no. 1 (electronic music created with this sequence)
Casey Mongoven, Sonification of multiple Fibonacci-related sequences, Annales Mathematicae et Informaticae, 41 (2013) pp. 175-192.

Cf. A019586, A035614, A098862.

A199087 The smallest row index of a row in A160271 (the monotonic justified array of generalized Fibonacci sequences) which contains n.

Original entry on oeis.org

0, 1, 1, 1, 2, 1, 2, 4, 1, 3, 2, 4, 5, 1, 6, 3, 2, 8, 4, 9, 5, 1, 12, 6, 3, 7, 2, 16, 8, 4, 10, 9, 5, 11, 1, 13, 12, 6, 14, 3, 7, 15, 2, 18, 16, 8, 19, 4, 10, 20, 9, 23, 5, 11, 24, 1, 13, 25, 12, 29, 6, 14, 30, 3, 17, 7, 15, 35, 2, 18, 36, 16, 21, 8, 19, 42

Offset: 0

Casey Mongoven, Nov 06 2011

nonn

Northwest corner of A160271, including the Fibonacci-type sequence containing only 0's as the 0th row:
...0....0....0....0....0....0....0....0....0
...0....1....1....2....3....5....8...13...21
...0....2....2....4....6...10...16...26...42
...0....3....3....6....9...15...24...39...63
...1....3....4....7...11...18...29...47...76
...0....4....4....8...12...20...32...52...84
...1....4....5....9...14...23...37...60...97
...0....5....5...10...15...25...40...65..105
...1....5....6...11...17...28...45...73..118
...2....5....7...12...19...31...50...81..131

Clark Kimberling, Orderings of the set of all positive Fibonacci sequences, in G. E. Bergum et al., editors, Applications of Fibonacci Numbers, Vol. 5 (1993), pp. 405-416.

Cf. A160271, A019586, A035513.

A345252 2-1-Fibonacci cohort array, a rectangular array T(n,k) read by downward antidiagonals.

Original entry on oeis.org

1, 2, 3, 4, 6, 5, 7, 11, 10, 8, 12, 19, 18, 16, 9, 20, 32, 31, 29, 17, 13, 33, 53, 52, 50, 30, 26, 14, 54, 87, 86, 84, 51, 47, 27, 15, 88, 142, 141, 139, 85, 81, 48, 28, 21, 143, 231, 230, 228, 140, 136, 82, 49, 42, 22, 232, 375, 374, 372, 229, 225, 137, 83, 76

Offset: 1

J. Parker Shectman, Jun 12 2021

As a sequence, {a(n)} permutes the positive integers. As an array, {T(n,k)} is an interspersion-dispersion or I-D array (refer to Kimberling, 1st linked reference).
The top row of {T(n,k)} is A000071 or one less than the Fibonacci numbers = 1, 2, 4, 7, 12, ....
The top row of {T(n,k)} alternates lower and upper Wythoff numbers, A000201 and A001950, respectively, while all subsequent rows consist entirely of lower Wythoff numbers or entirely of upper Wythoff numbers (cf. generating tree A345253).
The left column (k = 1) of {T(n,k)} is n + F(Finv(n) + 1), for rows indexed n = 0, 1, 2, ..., where F(n) = A000045(n) are the Fibonacci numbers and Finv(n) = A130233(n) is the 'lower' Fibonacci inverse.
For rows indexed n = 0, 1, 2, ..., and columns indexed k = 1, 2, 3, ..., T(n,k) is given by T(n,k) = L^(k - 1) R(n), the image of n under a composition of branching functions L(n) = n + F(Finv(n)) and R(n) = n + F(Finv(n) + 1) (cf. generating tree A345253).
Write the positive integers in natural order (A000027) as a right-justified "tetrangle" or "irregular triangle" tableau with F(t) (Fibonacci number) entries on each row t, for t = 1, 2, 3, .... Then, columns of the tableau equal rows of {T(n,k)} (2nd linked reference):
                               1,
                               2,
                           3,  4,
                       5,  6,  7,
               8,  9, 10, 11, 12,
  13, 14, 15, 16, 17, 18, 19, 20,
  ...
(Duality with array A194030): With the right-justified tableau substituted by a left-justified tableau, the above procedure yields the array A194030, making {T(n,k)} and A194030 "cohort-dual" arrays, where "cohort" t is the F(t)-sized block (F(t + 1), ..., F(t + 2) - 1) of successive positive integers on row t of both tableaux (2nd link under references, which calls A194030 the "1-2-Fibonacci cohort array", by analogy).
Analogous to A345254, its left-justified tableau of the positive integers in cohorts with lengths powers of two replaced by the above right-justified tableau with the Fibonacci numbers as lengths of the cohorts.
(Duality with array A083047): Consider the labeled binary trees A345253(n) = A232560(A059893(n)) and A232560(n) = A345253(A059893(n)). Rows of array {T(n,k)} are the labels along maximal straight paths that always branch left in A345253, while rows of array A083047 are the labels along maximal straight paths that always branch left in A232560.
Column k of {T(n,k)} comprises the (sorted) labels in the k-th right clade of binary tree A232560, while column k of A083047 comprises the (sorted) labels in the k-th right clades of binary tree A345253. This makes the arrays {T(n,k)} and A083047 "blade-duals", blade being a contraction of branch-clade (cf. A345253 and 2nd linked reference).
(Mirror duality): A "mirror dual" I-D array or "inverse I-D array" (see Kimberling in 1st linked reference) is obtained by mirroring the tree A345253 cited above, i.e., taking maximal straight paths that always branch right in A345253. With three types of duality then, {T(n,k)} forms an octet of I-D arrays together with its cohort dual A194030 and mirror duals of these two, its blade dual A083047 and cohort dual A035513 of the latter, and their respective mirror duals, A132817 and A191436.
(Para-sequences): Sequences of row and column indices (see Conway-Sloane correspondence under A019586, citing Kimberling). For rows indexed n = 0, 1, 2, ..., the row index n of positive integer T(n,k) follows a right-justified tableau with F(t) entries on each row t, for t = 1, 2, 3, ..., in which an entry on row t equals the entry immediately above it on row t-1, if such exists, or otherwise equals the minimum positive integer excluded from the tableau so far:
                       0,
                       0,
                    1, 0,
                 2, 1, 0,
           3, 4, 2, 1, 0,
  5, 6, 7, 3, 4, 2, 1, 0,
  ...
For columns indexed k = 1, 2, 3, ..., the column index k of positive integer T(n,k) follows a right-justified tableau with F(t) entries on each row t, for t = 1, 2, 3, ..., in which an entry x+1 on row t equals one plus the entry x immediately above it on row t-1, if such exists, or otherwise equals one:
                       1,
                       2,
                    1, 3,
                 1, 2, 4,
           1, 1, 2, 3, 5,
  1, 1, 1, 2, 2, 3, 4, 6,
  ...

			Northwest corner of {T(n,k)}:
       k=1 k=2 k=3 k=4 k=5  k=6 ...
  n=0:   1,  2,  4,  7, 12,  20, ...
  n=1:   3,  6, 11, 19, 32,  53, ...
  n=2:   5, 10, 18, 31, 52,  86, ...
  n=3:   8, 16, 29, 50, 84, 139, ...
  n=4:   9, 17, 30, 51, 85, 140, ...
  ...
Northwest corner of {T(n,k)} in maximal Fibonacci expansion (see link):
       k=1             k=2                  k=3                       ...
  n=0: F(1),           F(1)+F(2),           F(1)+F(2)+F(3),           ...
  n=1: F(1)+F(3),      F(1)+F(3)+F(4),      F(1)+F(3)+F(4)+F(5),      ...
  n=2: F(1)+F(2)+F(4), F(1)+F(2)+F(4)+F(5), F(1)+F(2)+F(4)+F(5)+F(6), ...
  ...
Northwest corner of {T(n,k)} as "Fibonacci gaps," or differences between successive indices in maximal Fibonacci expansion above, (see link):
       k=1   k=2    k=3     k=4      k=5       k=6  ...
  n=0:   *,    1,    11,    111,    1111,    11111, ...
  n=1:   2,   21,   211,   2111,   21111,   211111, ...
  n=2:  12,  121,  1211,  12111,  121111,  1211111, ...
  n=3:  22,  221,  2211,  22111,  221111,  2211111, ...
  n=4: 122, 1221, 12211, 122111, 1221111, 12211111, ...
  ...

Clark Kimberling, Interspersions and dispersions, Proceedings of the American Mathematical Society, 117 (1993) 313-321.
Parker Shectman, A Quilt after Fibonacci, Part 2 of 3: Cohorts, Free Monoids, and Numeration

Cf. A000027, A000045, A000071, A000201, A001950, A035513, A059893, A083047, A130233, A132817, A191436, A194030, A232560, A345253, A345254.

(* Define A000045 *)
F[n_] := Fibonacci[n]
(* Defined A130233 *)
Finv[n_] := Floor[Log[GoldenRatio, Sqrt[5]n + 1]]
(* Simplified Formula *)
MatrixForm[Table[n + F[Finv[n] + k + 2] - F[Finv[n] + 2], {n, 0, 4}, {k, 1, 6}]]
(* Branching Formula *)
MatrixForm[Table[NestList[Function[# + F[Finv[#]]], n + F[Finv[n] + 1], 5], {n, 0, 4}]]

T(n,k) = n + F(Finv(n) + k + 2) - F(Finv(n) + 2), for rows indexed n = 0, 1, 2, ... and columns indexed k = 1, 2, 3, ..., where F(n) = A000045(n) and Finv(n) = A130233.

T(n,k) = L^(k - 1) R(n), where L(n) = n + F(Finv(n)) and R(n) = n + F(Finv(n) + 1).

A345254 Dispersion of A004754, a rectangular array T(n,k) read by downward antidiagonals.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 8, 9, 10, 7, 16, 17, 18, 11, 12, 32, 33, 34, 19, 20, 13, 64, 65, 66, 35, 36, 21, 14, 128, 129, 130, 67, 68, 37, 22, 15, 256, 257, 258, 131, 132, 69, 38, 23, 24, 512, 513, 514, 259, 260, 133, 70, 39, 40, 25, 1024, 1025, 1026, 515, 516, 261, 134

Offset: 1

J. Parker Shectman, Jun 12 2021

As a sequence, {a(n)} permutes the positive integers. As an array, {T(n,k)} is an interspersion-dispersion or I-D array (refer to Kimberling, 1st linked reference).
The top row of {T(n,k)} is A000079 or powers of two = 1, 2, 4, 8, 16, ....
Except for the leftmost element "1" of the top row, rows of T(n,k) indexed n = 0, 1, 2, ..., consist entirely of even numbers (A005843) for n even and entirely of odd numbers (A005408) for n odd.
The left column (k = 1) of {T(n,k)} comprises a "1" for the top row (n = 0) and A004755(n) = n + 2^(floor(log_2(n)) + 1), for rows n = 1, 2, 3, ....
For rows indexed n = 0, 1, 2, ..., and columns indexed k = 1, 2, 3, ..., T(n,k) is given by T(0,k) = L^(k - 1)(1) and T(n,k) = L^(k - 1) R(n) for n = 1, 2, 3, ..., the image of n under a composition of branching functions L(n) = A004754(n) = n + 2^floor(log_2(n)) and R(n) = A004755(n) = n + 2^(floor(log_2(n)) + 1) (cf. generating tree A059893 and 2nd linked reference).
(Duality with array A054582): Consider A059893 and A000027 as labeled binary trees arranging the positive integers. In latter tree, node labels equal node positions, thus following their natural order. Rows of {T(n,k)} are the labels along maximal straight paths that always branch left in the former tree, while rows of (transposed) array A054582 are the labels along maximal straight paths that always branch left in the latter tree.
Column k of {T(n,k)} comprises the (sorted) labels in the k-th right clade of latter tree, while column k of (transposed) A054582 comprises the (sorted) labels in the k-th right clade of the former tree. This makes the arrays {T(n,k)} and (transposed) A054582 "blade-duals," blade being a contraction of branch-clade ('right clades' explained under tree A345253 and in 2nd link).
Write the positive integers in natural order as a (left-justified) "tetrangle" or "irregular triangle" tableau with 2^t entries on each row t, for t=1, 2, 3, .... Then, columns of the tableau equal rows of {T(n,k)} (2nd link):
   1,
   2,  3,
   4,  5,  6, 7,
   8,  9, 10, 11, 12, 13, 14, 15
  16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31,
  ...
Analogous to A345252, its right-justified tableau of the positive integers in cohorts with lengths the Fibonacci numbers replaced by the above left-justified tableau with powers of two as lengths of the cohorts.
(Mirror duality): A "mirror dual" I-D array or "inverse I-D array" (see Kimberling, 1st linked reference) is obtained by substituting the left-justified tableau by a right-justified tableau and following the identical procedure, or equivalently by mirroring the tree A059893 cited above, i.e., taking maximal straight paths that always branch right in the tree A059893. With two types of duality then, {T(n,k)} forms a quartet of I-D arrays together with its mirror dual, its blade dual (transposed) A054582 and mirror dual A191448 of the latter.
(Para-sequences): Sequences of row and column indices (see Conway-Sloane correspondence under A019586, citing Kimberling). For rows indexed n = 0, 1, 2, ..., and columns indexed k = 1, 2, 3, ..., the row index n of positive integer T(n,k) is A053645(T) and the column index k of positive integer T(n,k) is A065120(T).

			Northwest corner of {T(n,k)}:
       k=1   k=2    k=3     k=4      k=5       k=6
  n=0:   1,    2,     4,      8,      16,       32, ...
  n=1:   3,    5,     9,     17,      33,       65, ...
  n=2:   6,   10,    18,     34,      66,      130, ...
  n=3:   7,   11,    19,     35,      67,      131, ...
  n=4:  12,   20,    36,     68,     132,      260, ...
  ...
Northwest corner of {T(n,k)} in base-2:
        k=1  k=2    k=3     k=4      k=5       k=6
  n=0:  1,   10,    100,    1000,    10000,    100000, ...
  n=1:  11,  101,   1001,   10001,   100001,   1000001, ...
  n=2:  110, 1010,  10010,  100010,  1000010,  10000010, ...
  n=3:  111, 1011,  10011,  100010,  1000011,  10000011, ...
  n=4:  1100,10100, 100100, 1000100, 10000100, 100000100, ...
  ...

Clark Kimberling, Interspersions and dispersions, Proceedings of the American Mathematical Society, 117 (1993) 313-321.
Parker Shectman, A Quilt after Fibonacci, Part 2 of 3: Cohorts, Free Monoids, and Numeration, 2021.
Index entries for sequences that are permutations of the natural numbers

Cf. A000027, A004754, A053645, A005408, A005843, A019586, A054582, A059893, A065120, A139706, A139708, A191448, A345252, A345253.
Rows n=0..1: A000079, A048578.
Columns k=1..2: A004755, A004757.

(*Simplified Formula*)
MatrixForm[Prepend[Table[n + 2^(Floor[Log[2, n]] + k), {n, 1, 4}, {k, 1, 6}], Table[2^(k - 1), {k, 1, 6}]]]
(*Branching Formula*)
MatrixForm[Prepend[Table[NestList[Function[# + 2^(Floor[Log[2, #]])], n + 2^(Floor[Log[2, n]] + 1), 5], {n, 1, 4}], NestList[Function[# + 2^(Floor[Log[2, #]])], 1, 5]]]

T(n, k) = if (n==0, 2^(k-1), n + 2^(log(n)\log(2) + k));
matrix(7, 7, n, k, n--; T(n, k)) \\ Michel Marcus, Jul 30 2021

T(0,k) = 2^(k - 1) and T(n,k) = n + 2^(floor(log_2(n)) + k) for n >= 1.
T(0,k) = L^(k - 1)(1) and T(n,k) = L^(k - 1) R(n) for n = 1, 2, 3, ..., where L(n) = A004754(n) = n + 2^floor(log_2(n)) and R(n) = A004755(n) = n + 2^(floor(log_2(n)) + 1).
Let b(n) = A054582(n-1). Then for all n >= 1, a(n) = A139706(b(n)) and b(n) = A139708(a(n)).

cp's OEIS Frontend

A098861 a(n) = row number in Stolarsky array that contains n. If the first occurrence of a number in the sequence is deleted, the sequence remains unchanged.

Views

Author

Keywords

Comments

References

Links

Crossrefs

A199087 The smallest row index of a row in A160271 (the monotonic justified array of generalized Fibonacci sequences) which contains n.

Views

Author

Keywords

Comments

Links

Crossrefs

A345252 2-1-Fibonacci cohort array, a rectangular array T(n,k) read by downward antidiagonals.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A345254 Dispersion of A004754, a rectangular array T(n,k) read by downward antidiagonals.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A019594 Conway's "para-budding" sequence.

Views

Author

Keywords

References

Links