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.

A293219 a(n) = A000188(A292270(n)).

This page as a plain text file.
%I A293219 #6 Oct 07 2017 21:55:56
%S A293219 1,1,2,1,1,5,6,1,1,9,2,1,2,11,14,1,1,1,18,1,4,5,1,7,2,1,26,1,1,29,30,
%T A293219 1,2,33,1,2,1,1,3,1,1,41,2,1,2,1,1,22,1,1,50,1,2,53,2,2,2,7,1,3,5,4,2,
%U A293219 1,1,65,1,1,2,69,1,17,2,1,74,1,1,7,2,1,1,81,1,1,6,7,86,1,1,89,90,26,2,1,1,1,1,1,98,3,3,6,2,1,1,105
%N A293219 a(n) = A000188(A292270(n)).
%H A293219 Antti Karttunen, <a href="/A293219/b293219.txt">Table of n, a(n) for n = 0..10000</a>
%F A293219 a(n) = A000188(A292270(n)).
%o A293219 (PARI)
%o A293219 A000188(n) = core(n, 1)[2]; \\ This function from _Michel Marcus_, Feb 27 2013
%o A293219 A000265(n) = (n >> valuation(n, 2));
%o A293219 A006519(n) = 2^valuation(n, 2);
%o A293219 A292270(n) = { my(x = n+n+1, z = ((1+x)/A006519(1+x)), m = A000265(1+x)); while(m!=1, z += ((x+m)/A006519(x+m)); m = A000265(x+m)); z; };
%o A293219 A293219(n) = A000188(A292270(n));
%o A293219 (Scheme) (define (A293219 n) (A000188 (A292270 n)))
%Y A293219 Cf. A000188, A292270, A292947, A293218.
%Y A293219 Cf. A163782 (after a(1) = 1 gives the other positions where a(n) = n).
%K A293219 nonn
%O A293219 0,3
%A A293219 _Antti Karttunen_, Oct 07 2017