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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A159586 a(n) is the smallest number not yet used such that n*a(n) is a square, but n != a(n). 0

%I #2 Mar 30 2012 17:35:23

%S 4,8,12,1,20,24,28,2,16,40,44,3,52,56,60,9,68,32,76,5,84,88,92,6,36,

%T 104,48,7,116,120,124,18,132,136,140,25,148,152,156,10,164,168,172,11,

%U 80,184,188,27,64,72,204,13,212,96,220,14,228,232,236,15,244,248,112,49

%N a(n) is the smallest number not yet used such that n*a(n) is a square, but n != a(n).

%C This is a self-inverse permutation of the positive integers.

%C Equivalently, the geometric mean of n and a(n) is an integer.

%C If n is squarefree, a(n) = 4n.

%o (PARI) invect(v,n,x)=for(i=1,n,if(v[i]==x,return(1)));0

%o nextnew(v,n)=local(k);k=1;while(!R(n,k)||invect(v,n-1,k),k++);k

%o newvect(n)=local(v);v=vector(n);for(k=1,n,v[k]=nextnew(v,k));v

%o R(n,m)=issquare(n*m)&&n!=m

%o newvect(80)

%Y Cf. A159253, A056135.

%K nonn

%O 1,1

%A _Franklin T. Adams-Watters_, Apr 16 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)