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.

A377982 a(n) is the number of terms of A048103 (numbers with no p^p divisors) less than or equal to n.

This page as a plain text file.
%I A377982 #11 Nov 13 2024 13:53:27
%S A377982 0,1,2,3,3,4,5,6,6,7,8,9,9,10,11,12,12,13,14,15,15,16,17,18,18,19,20,
%T A377982 20,20,21,22,23,23,24,25,26,26,27,28,29,29,30,31,32,32,33,34,35,35,36,
%U A377982 37,38,38,39,39,40,40,41,42,43,43,44,45,46,46,47,48,49,49,50,51,52,52,53,54,55,55,56,57,58,58,58,59
%N A377982 a(n) is the number of terms of A048103 (numbers with no p^p divisors) less than or equal to n.
%C A377982 The number of terms in the range of A276086 that are <= n.
%H A377982 Antti Karttunen, <a href="/A377982/b377982.txt">Table of n, a(n) for n = 0..100000</a>
%F A377982 a(n) = Sum_{i=0..n} A359550(i).
%o A377982 (PARI)
%o A377982 up_to = 10000;
%o A377982 A359550(n) = { my(pp); forprime(p=2, , pp = p^p; if(!(n%pp), return(0)); if(pp > n, return(1))); };
%o A377982 A377982list(up_to) = { my(v=vector(1+up_to), s=0); v[1] = s = A359550(0); for(n=1,up_to,s += A359550(n); v[1+n] = s); (v); };
%o A377982 v377982 = A377982list(up_to);
%o A377982 A377982(n) = v377982[1+n];
%Y A377982 Partial sums of A359550.
%Y A377982 Cf. A048103, A276086, A376411.
%Y A377982 Cf. also A377983.
%K A377982 nonn
%O A377982 0,3
%A A377982 _Antti Karttunen_, Nov 13 2024