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.

A275463 Least k such that n divides d(k*n) (d = A000005).

Original entry on oeis.org

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
Offset: 1

Views

Author

Altug Alkan, Jul 28 2016

Keywords

Examples

			a(5) = 16 because 5 divides A000005(16*5) = 10.
a(40) = 42 because 40 divides A000005(42*40) = 40.
		

Crossrefs

Programs

  • PARI
    a(n) = if(isprime(n) && n>3, 2^(n-1), {my(k=1); while(numdiv(k*n) % n != 0, k++); k; })