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.

A295880 Filter combining the number of divisors (A000005) and the sum of divisors (A000203) of n.

This page as a plain text file.
%I A295880 #6 Dec 04 2017 08:59:24
%S A295880 1,2,3,4,5,6,7,8,9,10,11,12,13,14,14,15,16,17,18,19,20,21,22,23,24,25,
%T A295880 26,27,28,29,30,31,32,33,32,34,35,36,37,38,39,40,41,42,43,44,45,46,47,
%U A295880 48,44,49,50,51,44,51,52,53,54,55,56,57,58,59,60,61,62,63,57,61,64,65,66,67,68,69,57,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,79
%N A295880 Filter combining the number of divisors (A000005) and the sum of divisors (A000203) of n.
%H A295880 Antti Karttunen, <a href="/A295880/b295880.txt">Table of n, a(n) for n = 1..65537</a>
%F A295880 Restricted growth sequence transform of a(n) = (1/2)*(2 + ((A000005(n) + A000203(n))^2) - A000005(n) - 3*A000203(n)).
%o A295880 (PARI)
%o A295880 allocatemem(2^30);
%o A295880 up_to = 65537;
%o A295880 rgs_transform(invec) = { my(om = Map(), outvec = vector(length(invec)), u=1); for(i=1, length(invec), if(mapisdefined(om,invec[i]), my(pp = mapget(om, invec[i])); outvec[i] = outvec[pp] , mapput(om,invec[i],i); outvec[i] = u; u++ )); outvec; };
%o A295880 write_to_bfile(start_offset,vec,bfilename) = { for(n=1, length(vec), write(bfilename, (n+start_offset)-1, " ", vec[n])); }
%o A295880 A000005(n) = numdiv(n);
%o A295880 A000203(n) = sigma(n);
%o A295880 Anotsubmitted0(n) = (1/2)*(2 + ((A000005(n)+A000203(n))^2) - A000005(n) - 3*A000203(n));
%o A295880 write_to_bfile(1,rgs_transform(vector(up_to,n,Anotsubmitted0(n))),"b295880.txt");
%Y A295880 Cf. A000005, A000203, A295300, A295888.
%K A295880 nonn
%O A295880 1,2
%A A295880 _Antti Karttunen_, Dec 03 2017