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.

A366788 a(n) = A366388(A163511(n)).

This page as a plain text file.
%I A366788 #7 Oct 23 2023 16:36:56
%S A366788 0,0,0,1,0,2,1,2,0,3,2,4,1,3,2,1,0,4,3,6,2,5,4,2,1,4,3,3,2,2,1,3,0,5,
%T A366788 4,8,3,7,6,3,2,6,5,4,4,3,2,6,1,5,4,5,3,4,3,4,2,3,2,5,1,4,3,2,0,6,5,10,
%U A366788 4,9,8,4,3,8,7,5,6,4,3,9,2,7,6,6,5,5,4,7,4,4,3,8,2,7,6,4,1,6,5,7,4,6,5,5,3,5
%N A366788 a(n) = A366388(A163511(n)).
%H A366788 Antti Karttunen, <a href="/A366788/b366788.txt">Table of n, a(n) for n = 0..65537</a>
%H A366788 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%H A366788 <a href="/index/Mat#matula">Index entries for sequences related to Matula-Goebel numbers</a>
%o A366788 (PARI)
%o A366788 A163511(n) = if(!n, 1, my(p=2, t=1); while(n>1, if(!(n%2), (t*=p), p=nextprime(1+p)); n >>= 1); (t*p));
%o A366788 A366388(n) = if(n<=2, 0, if(isprime(n), 1+A366388(primepi(n)), my(f=factor(n)); (apply(A366388, f[, 1])~ * f[, 2])));
%o A366788 A366788(n) = A366388(A163511(n));
%Y A366788 Cf. A163511, A366388, A366791.
%Y A366788 Cf. also A334204, A365385.
%K A366788 nonn
%O A366788 0,6
%A A366788 _Antti Karttunen_, Oct 23 2023