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.

A008333 Sum of divisors of p+1, p prime.

This page as a plain text file.
%I A008333 #28 Apr 19 2020 07:52:35
%S A008333 4,7,12,15,28,24,39,42,60,72,63,60,96,84,124,120,168,96,126,195,114,
%T A008333 186,224,234,171,216,210,280,216,240,255,336,288,336,372,300,240,294,
%U A008333 480,360,546,336,508,294,468,465,378,504,560,432,546,744,399,728,528,720,720,558
%N A008333 Sum of divisors of p+1, p prime.
%H A008333 Vincenzo Librandi, <a href="/A008333/b008333.txt">Table of n, a(n) for n = 1..999</a> (offset adapted by Michel Marcus)
%F A008333 a(n) = A000203(A008864(n)). - _Michel Marcus_, May 11 2016
%F A008333 a(n) = A000203(A000203(prime(n))) = A051027(prime(n)). - _Michel Marcus_, May 11 2016
%p A008333 for i from 1 to 500 do if isprime(i) then print(sigma(i+1)); fi; od;
%t A008333 lst={};Do[AppendTo[lst, DivisorSigma[1, Prime[n]+1]], {n, 6!}];lst (* _Vladimir Joseph Stephan Orlovsky_, Sep 20 2008 *)
%o A008333 (PARI) a(n) = sigma(prime(n)+1); \\ _Michel Marcus_, May 11 2016
%Y A008333 Cf. A000203, A008864, A051027.
%K A008333 nonn,easy
%O A008333 1,1
%A A008333 _N. J. A. Sloane_
%E A008333 Offset 1 from _Michel Marcus_, Apr 19 2020