The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A167411 a(n) = the minimal K value for the orderly number A167408(n). 4

%I

%S 2,3,3,5,5,7,3,7,11,3,17,7,3,5,3,29,5,5,3,41,3,7,3,5,5,3,59,5,7,3,13,

%T 71,7,7,3,5,3,5,3,101,3,107,3,7,5,7,5,3,5,3,137,3,149,5,5,11,7,7,3,3,

%U 5,5,3,179,7,3,191,3,197,5,11,5,13,3,227,3,7,5,3,239,7,7,5,3,11,3,3,5,3

%N a(n) = the minimal K value for the orderly number A167408(n).

%H A. Weimholt, <a href="/A167411/b167411.txt">Table of n, a(n) for n=1,...,10000</a>

%e a(6) = 7, because A167408(6) = 9, and divisors of 9 = {1,9,3} == {1,2,3} mod 7.

%t orderlyQkValue[n_] := (For[dd = Divisors[n]; tau = Length[dd]; k = 2, k <= Max[tau + 4, Last[dd] - 2], k++, If[Union[Mod[dd, k]] == Range[tau], Return[{True, k}]]]; {False, 0}); A167411List = Select[{#, orderlyQkValue[#]}& /@ Range[400] , #[[2, 1]]&][[All, 2, 2]] (* _Jean-François Alcover_, Nov 03 2016 *)

%Y Cf. A167408 - Orderly Numbers

%Y Cf. A167409 - Very Orderly Numbers ( K = tau(N)+1 )

%Y Cf. A167410 - Disorderly Numbers - numbers not in A167408

%K nonn

%O 1,1

%A _Andrew Weimholt_, Nov 03 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 29 09:49 EST 2022. Contains 358423 sequences. (Running on oeis4.)