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.

A069789 Smallest k>n such that sigma(n) divides sigma(k).

This page as a plain text file.
%I A069789 #14 Jun 03 2022 03:20:42
%S A069789 2,5,6,12,6,11,14,24,18,17,14,28,20,15,23,25,22,45,24,26,31,30,30,38,
%T A069789 48,41,54,39,38,46,42,68,35,53,42,117,74,54,60,58,44,62,86,60,90,51,
%U A069789 62,75,74,80,55,97,85,56,66,87,79,88,87,78,75,69,103,192,78,70,134,82,77
%N A069789 Smallest k>n such that sigma(n) divides sigma(k).
%H A069789 Ivan Neretin, <a href="/A069789/b069789.txt">Table of n, a(n) for n = 1..10000</a>
%t A069789 a[n_] := Module[{k = n+1, s = DivisorSigma[1, n]}, While[!Divisible[DivisorSigma[1, k], s], k++]; k]; Array[a, 100] (* _Amiram Eldar_, Jun 03 2022 *)
%o A069789 (PARI) for(s=1,80,n=s+1; while(frac(sigma(n)/sigma(s))>0,n++); print1(n,","); )
%Y A069789 Cf. A000203.
%K A069789 easy,nonn
%O A069789 1,1
%A A069789 _Benoit Cloitre_, May 01 2002