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!)
A086958 m such that A086956(m)=n and A086956(k)=n for exactly one k<m (k=A086957(n)). 8

%I #3 Mar 30 2012 18:50:37

%S 2,6,12,20,10,30,14,40,45,60,22,84,26,42,90,80,34,126,38,120,147,66,

%T 46,216,150,78,135,224,58,210,62,160,132,102,245,324,74,114,156,320,

%U 82,336,86,220,315,138,94,432,98,300,204,260,106,540,110,448,228,174

%N m such that A086956(m)=n and A086956(k)=n for exactly one k<m (k=A086957(n)).

%C A086957(n) < a(n) < A086959(n), A086956(a(n))=A086956(A086957(n))=A086956(A086959(n));

%C n and A086956(n) are divisors of a(n);

%C A086960(A086957(n)) = a(n), A086960(a(n)) = A086959(n);

%C A086961(a(n)) = A086957(n), A086961(A086959(n)) = a(n);

%C A086962(a(n)) = A086959(n), A086962(A086959(n)) = a(n);

%C A086963(a(n)) = a(n);

%C A086964(A086957(n)) = a(n), A086964(a(n)) = A086957(n).

%Y Cf. A086938, A086939.

%K nonn

%O 1,1

%A _Reinhard Zumkeller_, Jul 25 2003

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 August 15 03:10 EDT 2024. Contains 375172 sequences. (Running on oeis4.)