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.

A246908 a(n) = sigma(n + sigma(n)) - sigma(n).

This page as a plain text file.
%I A246908 #13 Sep 08 2022 08:46:09
%S A246908 2,3,4,5,6,27,16,9,23,38,12,62,26,36,32,17,30,41,36,54,22,54,24,164,
%T A246908 89,84,28,168,30,144,72,57,73,126,36,37,86,111,64,162,42,192,76,171,
%U A246908 90,108,72,184,105,75,96,274,54,240,56,252,58,176,84,392,106,144
%N A246908 a(n) = sigma(n + sigma(n)) - sigma(n).
%H A246908 Ivan Neretin, <a href="/A246908/b246908.txt">Table of n, a(n) for n = 1..10000</a>
%F A246908 a(n) = n + 1 for number in A078762 (numbers n such that n + sigma(n) is prime).
%e A246908 For n = 6; a(n) = sigma(6 + sigma(6)) - sigma(6) = sigma(18) - sigma(6) = 39 - 12 = 27.
%t A246908 sig[n_]:=Module[{d6=DivisorSigma[1,n]},DivisorSigma[1,n+d6]-d6]; Array[ sig,70] (* _Harvey P. Dale_, Feb 20 2015 *)
%o A246908 (Magma) [SumOfDivisors(n+SumOfDivisors(n))-SumOfDivisors(n):n in[1..1000]]
%o A246908 (PARI) vector(100,n,sigma(n+sigma(n))-sigma(n)) \\ _Derek Orr_, Sep 07 2014
%Y A246908 Cf. A000203, A078762, A246456.
%K A246908 nonn
%O A246908 1,1
%A A246908 _Jaroslav Krizek_, Sep 07 2014