This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A275463 Least k such that n divides d(k*n) (d = A000005). 0
 1, 1, 3, 2, 16, 2, 64, 3, 4, 8, 1024, 5, 4096, 32, 48, 24, 65536, 10, 262144, 12, 192, 512, 4194304, 15, 400, 2048, 900, 48, 268435456, 24, 1073741824, 60, 3072, 32768, 5184, 35, 68719476736, 131072, 12288, 42, 1099511627776, 96, 4398046511104 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS EXAMPLE a(5) = 16 because 5 divides A000005(16*5) = 10. a(40) = 42 because 40 divides A000005(42*40) = 40. PROG (PARI) a(n) = if(isprime(n) && n>3, 2^(n-1), {my(k=1); while(numdiv(k*n) % n != 0, k++); k; }) CROSSREFS Cf. A000005, A076931. Sequence in context: A126323 A292123 A084886 * A304989 A055864 A209600 Adjacent sequences:  A275460 A275461 A275462 * A275464 A275465 A275466 KEYWORD nonn AUTHOR Altug Alkan, Jul 28 2016 STATUS approved

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

Last modified August 17 11:51 EDT 2019. Contains 326057 sequences. (Running on oeis4.)