cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A183079 Tree generated by the triangular numbers: a(1) = 1; a(2n) = nontriangular(a(n)), a(2n+1) = triangular(a(n+1)), where triangular = A000217, nontriangular = A014132.

Original entry on oeis.org

1, 2, 3, 4, 6, 5, 10, 7, 21, 9, 15, 8, 55, 14, 28, 11, 231, 27, 45, 13, 120, 20, 36, 12, 1540, 65, 105, 19, 406, 35, 66, 16, 26796, 252, 378, 34, 1035, 54, 91, 18, 7260, 135, 210, 26, 666, 44, 78, 17, 1186570, 1595, 2145, 76, 5565, 119, 190, 25, 82621, 434
Offset: 1

Views

Author

Clark Kimberling, Dec 23 2010

Keywords

Comments

A permutation of the positive integers.
In general, suppose that L and U are complementary sequences of positive integers such that
(1) L(1)=1; and
(2) if n>1, then n=L(k) or n=U(k) for some k
The tree generated by the sequence L is defined as follows:
T(0,0)=1; T(1,0)=2; T(n,2j)=L(T(n-1,j));
T(n,2j+1)=U(T(n-1,j)); for j=0,1,...,2^(n-1)-1, n>=2.
The numbers, taken in the order generated, form a permutation of the positive integers.

Examples

			First levels of the tree:
                                    1
                                    |
                 ...................2...................
                3                                       4
      6......../ \........5                   10......./ \........7
     / \                 / \                 / \                 / \
    /   \               /   \               /   \               /   \
   /     \             /     \             /     \             /     \
  21      9          15       8          55       14         28      11
231 27  45 13     120  20   36 12    1540  65  105  19    406  35  66  16
Beginning with 3 and 4, the numbers are generated in pairs, such as (3,4), (6,5), (10,7), (21,9),...
In all such pairs, the first number belongs to A000217; the second, to A014132.
		

Crossrefs

Cf. A220347 (inverse), A220348.
Cf. A183089, A183209 (similar permutations), also A257798.

Programs

  • Haskell
    a183079 n k = a183079_tabf !! (n-1) !! (k-1)
    a183079_row n = a183079_tabf !! n
    a183079_tabf = [1] : iterate (\row -> concatMap f row) [2]
       where f x = [a000217 x, a014132 x]
    a183079_list = concat a183079_tabf
    -- Reinhard Zumkeller, Dec 12 2012
    
  • Mathematica
    tr[n_]:=n*(n+1)/2; nt[n_]:= n+Round@ Sqrt[2*n];a[1]=1; a[n_Integer] := a[n] = If[ EvenQ@n, nt@a[n/2], tr@ a@ Ceiling[n/2]]; a/@Range[58] (* Giovanni Resta, May 20 2015 *)
  • Scheme
    ;; With memoizing definec-macro.
    (definec (A183079 n) (cond ((<= n 1) n) ((even? n) (A014132 (A183079 (/ n 2)))) (else (A000217 (A183079 (/ (+ n 1) 2))))))
    ;; Antti Karttunen, May 18 2015

Formula

Let L(n) be the n-th triangular number (A000217).
Let U(n) be the n-th non-triangular number (A014132).
The tree-array T(n,k) is then given by rows:
T(0,0)=1; T(1,0)=2;
T(n,2j)=L(T(n-1,j));
T(n,2j+1)=U(T(n-1,j));
for j=0,1,...,2^(n-1)-1, n>=2.
a(1) = 1; after which: a(2n) = A014132(a(n)), a(2n+1) = A000217(a(n+1)). - Antti Karttunen, May 20 2015

Extensions

Formula added to the name and a new tree illustration to the Example section by Antti Karttunen, May 20 2015

A220347 Permutation of natural numbers: a(1) = 1, a(triangular(n)) = (2*a(n))-1, a(nontriangular(n)) = 2*n, where triangular = A000217, nontriangular = A014132.

Original entry on oeis.org

1, 2, 3, 4, 6, 5, 8, 12, 10, 7, 16, 24, 20, 14, 11, 32, 48, 40, 28, 22, 9, 64, 96, 80, 56, 44, 18, 15, 128, 192, 160, 112, 88, 36, 30, 23, 256, 384, 320, 224, 176, 72, 60, 46, 19, 512, 768, 640, 448, 352, 144, 120, 92, 38, 13, 1024, 1536, 1280, 896, 704, 288
Offset: 1

Author

Reinhard Zumkeller, Dec 12 2012

Keywords

Comments

Inverse permutation of A183079, when seen as a flattened sequence.

Crossrefs

Inverse: A183079.
Cf. also a similar permutation A257797 from which this differs for the first time at n=15, where a(15) = 11, while A257797(15) = 9.

Programs

  • Haskell
    import Data.List (elemIndex)
    import Data.Maybe (fromJust)
    a220347 =  (+ 1) . fromJust . (`elemIndex` a183079_list)
    
  • Mathematica
    a[n_] := a[n] = With[{r = (-1 + Sqrt[8n + 1])/2}, Which[n <= 1, n, IntegerQ[r], 2 a[Floor[Sqrt[2n] + 1/2]] - 1, True, 2 a[n - Floor[r]]]];
    Table[a[n], {n, 1, 100}] (* Jean-François Alcover, Dec 05 2021 *)
  • Scheme
    ;; With memoizing definec-macro.
    (definec (A220347 n) (cond ((<= n 1) n) ((zero? (A010054 n)) (* 2 (A220347 (A083920 n)))) (else (+ -1 (* 2 (A220347 (A002024 n)))))))
    ;; Antti Karttunen, May 18 2015

Formula

a(1) = 1; for n > 1: if A010054(n) = 1 [i.e., if n is triangular], then a(n) = (2*a(A002024(n)))-1, otherwise a(n) = 2*a(A083920(n)). - Antti Karttunen, May 18 2015

Extensions

Old name moved to comments by Antti Karttunen, May 18 2015
Showing 1-2 of 2 results.