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.

A266350 Partial sums of f(n) = A192490(2n+1); least monotonic left inverse of A266409.

This page as a plain text file.
%I A266350 #7 Jan 30 2016 03:09:08
%S A266350 1,2,3,3,4,5,5,6,6,6,7,8,8,9,9,9,9,10,10,11,12,12,13,13,13,14,14,14,
%T A266350 14,15,15,15,16,16,17,17,17,18,18,18,19,19,19,20,21,21,21,22,22,22,22,
%U A266350 22,23,23,23,23,24,24,25,26,26,26,27,27,28,28,28,28,28,28,29,29,29,30,30,30,30,31,31,32,32
%N A266350 Partial sums of f(n) = A192490(2n+1); least monotonic left inverse of A266409.
%H A266350 Antti Karttunen, <a href="/A266350/b266350.txt">Table of n, a(n) for n = 1..10011</a>
%F A266350 a(1) = 1; for n > 1, a(n) = a(n-1) + A192490(2n + 1).
%F A266350 Other identities. For all n >= 1:
%F A266350 a(A266409(n)) = n.
%o A266350 (Scheme, two versions)
%o A266350 (definec (A266350 n) (if (<= n 1) n (+ (A266350 (- n 1)) (A192490 (+ n n 1)))))
%o A266350 (define A266350 (LEFTINV-LEASTMONO 1 1 A266409))
%Y A266350 Cf. A192490, A266409.
%Y A266350 Cf. also permutations A266417, A266637.
%K A266350 nonn
%O A266350 1,2
%A A266350 _Antti Karttunen_, Jan 28 2016