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.

A291530 a(n) is the smallest k such that uphi(k*n) = uphi(k*n+1), or 0 if no such k exists.

This page as a plain text file.
%I A291530 #11 Sep 20 2018 08:16:29
%S A291530 1,10,373,5,4,372,5,26,248,2,13,186,11,562,247,13,627,124,195,1,183,
%T A291530 86,245,93,5184,8,185,281,1623,4320,72,738,43,2296,1,62,20,2312,95,
%U A291530 3240,576,732,33,43,111,4600,540100,492,115,2592,209,4,25383,2388,629,549,65,1732,64476,2160,20,36,61
%N A291530 a(n) is the smallest k such that uphi(k*n) = uphi(k*n+1), or 0 if no such k exists.
%e A291530 a(3) = 373 because uphi(373*3) = uphi(373*3+1) and 373 is the smallest number with this property.
%o A291530 (PARI) uphi(n) = my(f=factor(n)); prod(i=1, #f~, f[i, 1]^f[1, 2]-1);
%o A291530 a(n) = {my(k = 1); while (uphi(k*n) != uphi(k*n+1), k++); k; }
%Y A291530 Cf. A047994, A275412, A287055.
%K A291530 nonn
%O A291530 1,2
%A A291530 _Altug Alkan_, Aug 25 2017