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.

A195071 Inverse permutation of A194922; every positive integer occurs exactly once.

This page as a plain text file.
%I A195071 #9 Nov 18 2017 20:56:19
%S A195071 1,3,2,6,5,4,9,10,8,7,13,15,14,12,11,18,21,20,19,17,16,24,27,28,26,25,
%T A195071 23,22,31,34,36,35,33,32,30,29,39,42,45,44,43,41,40,38,37,48,51,55,54,
%U A195071 53,52,50,49,47,46,58,61,65,66,64,63,62,60,59,57,56,69,72,76
%N A195071 Inverse permutation of A194922; every positive integer occurs exactly once.
%H A195071 G. C. Greubel, <a href="/A195071/b195071.txt">Table of n, a(n) for n = 1..5000</a>
%t A195071 r = Sqrt[2]; p[n_] := n - Floor[n/r]
%t A195071 Table[p[n], {n, 1, 90}]  (* A194920 *)
%t A195071 g[1] = {1}; g[n_] := Insert[g[n - 1], n, p[n]]
%t A195071 f[1] = g[1]; f[n_] := Join[f[n - 1], g[n]]
%t A195071 f[20]  (* A194921 *)
%t A195071 row[n_] := Position[f[30], n];
%t A195071 u = TableForm[Table[row[n], {n, 1, 5}]]
%t A195071 v[n_, k_] := Part[row[n], k];
%t A195071 w = Flatten[Table[v[k, n - k + 1], {n, 1, 13},
%t A195071 {k, 1, n}]]  (* A194922 *)
%t A195071 q[n_] := Position[w, n]; Flatten[Table[q[n],
%t A195071 {n, 1, 80}]]   (* A195071 *)
%Y A195071 Cf. A194922, A194921, A194920, A194959.
%K A195071 nonn
%O A195071 1,2
%A A195071 _Clark Kimberling_, Sep 08 2011