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.

A054077 Inverse of the permutation A054073 of N.

This page as a plain text file.
%I A054077 #7 Mar 30 2012 18:57:01
%S A054077 1,2,3,5,6,4,8,10,7,9,13,15,12,14,11,18,21,17,20,16,19,24,27,23,26,22,
%T A054077 25,28,32,35,30,34,29,33,36,31,40,44,38,42,37,41,45,39,43,50,54,48,52,
%U A054077 46,51,55,49,53,47,60,65,58,63,56,61,66,59
%N A054077 Inverse of the permutation A054073 of N.
%C A054077 When formatted as a rectangular array, row n gives the positions of n in A054073; the array is an interspersion.  (Each pair of rows eventually intersperse.)
%e A054077 Northwest corner when formatted as an interspersion:
%e A054077 1...2...5...8...13..18
%e A054077 3...6...10..15..21..27
%e A054077 4...7...12..17..23..30
%e A054077 9...14..20..26..34..42
%e A054077 11..16..22..29..37..46
%e A054077 19..25..33..41..51..61
%t A054077 r = Sqrt[2];
%t A054077 t[n_] := Table[FractionalPart[k*r], {k, 1, n}];
%t A054077 f = Flatten[Table[Flatten[(Position[t[n], #1] &) /@ Sort[t[n], Less]],
%t A054077  {n, 1, 20}]] (* A054073 *)
%t A054077 TableForm[Table[Flatten[(Position[t[n], #1] &) /@ Sort[t[n], Less]], {n, 1, 15}]]
%t A054077 row[n_] := Position[f, n];
%t A054077 u = TableForm[Table[row[n], {n, 1, 20}]]
%t A054077 g[n_, k_] := Part[row[n], k];
%t A054077 p = Flatten[Table[g[k, n - k + 1], {n, 1, 13},
%t A054077  {k, 1, n}]] (* A054077 *)
%t A054077 q[n_] := Position[p, n]; Flatten[
%t A054077  Table[q[n], {n, 1, 80}]]  (* A054076 *)
%K A054077 nonn
%O A054077 1,2
%A A054077 _Clark Kimberling_