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.

A351951 a(n) = A069359(A276076(n)).

This page as a plain text file.
%I A351951 #8 Apr 02 2022 10:32:22
%S A351951 0,1,1,5,3,15,1,7,8,31,24,93,5,35,40,155,120,465,25,175,200,775,600,
%T A351951 2325,1,9,10,41,30,123,12,59,71,247,213,741,60,295,355,1235,1065,3705,
%U A351951 300,1475,1775,6175,5325,18525,7,63,70,287,210,861,84,413,497,1729,1491,5187,420,2065,2485,8645,7455,25935,2100
%N A351951 a(n) = A069359(A276076(n)).
%H A351951 Antti Karttunen, <a href="/A351951/b351951.txt">Table of n, a(n) for n = 0..10080</a>
%H A351951 <a href="/index/Fa#facbase">Index entries for sequences related to factorial base representation</a>
%F A351951 a(n) = A069359(A276076(n)).
%F A351951 a(n) = A329029(A351576(n)).
%o A351951 (PARI)
%o A351951 A069359(n) = (n*sumdiv(n, d, isprime(d)/d)); \\ From A069359
%o A351951 A276076(n) = { my(i=0,m=1,f=1,nextf); while((n>0),i=i+1; nextf = (i+1)*f; if((n%nextf),m*=(prime(i)^((n%nextf)/f));n-=(n%nextf));f=nextf); m; };
%o A351951 A351951(n) = A069359(A276076(n));
%Y A351951 Cf. A069359, A276076, A329029, A351576.
%Y A351951 Coincides with A351950 on positions given by A059590.
%K A351951 nonn,base
%O A351951 0,4
%A A351951 _Antti Karttunen_, Apr 01 2022