The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A160133 Values k such that A001065(x)= k has more than one solution. 0
 1, 6, 8, 13, 14, 15, 16, 17, 19, 20, 21, 22, 23, 25, 27, 29, 31, 32, 33, 35, 37, 40, 41, 42, 43, 44, 45, 46, 47, 49, 50, 51, 53, 54, 55, 57, 59, 61, 62, 63, 64, 65, 67, 69, 71, 73, 74, 75, 76, 77, 79, 81, 83, 85, 87, 89, 90, 91, 92, 93, 95, 97, 99, 100, 101, 103, 104, 105 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Numbers k with A048138(k) >= 2. Numbers k which occur in A001065 more than once. Number 1 and numbers k = A160095(n) with A160095(n+1) - A160095(n) = 0. LINKS EXAMPLE a(3)=8 as the multiplicity of the value 8 is 2: 8 = A001065(10) = A001065(49). PROG (PARI) {z=105; v=vector(z); for(n=1, z^2, a=sigma(n)-n; if(01, print1(j, ", ")))} // Klaus Brockhaus, May 26 2009 CROSSREFS Cf. A048138, A001065, A160095. Sequence in context: A327240 A274001 A324212 * A057710 A285678 A027706 Adjacent sequences:  A160130 A160131 A160132 * A160134 A160135 A160136 KEYWORD nonn AUTHOR Jaroslav Krizek, May 02 2009 EXTENSIONS More terms from Klaus Brockhaus, May 26 2009 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 February 26 03:34 EST 2020. Contains 332273 sequences. (Running on oeis4.)