This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A079852 a(1) = 1, a(2) = 2, a(3) =3 and a(n) is the smallest number such that all a(i)*a(j*a(k) are different. 3
 1, 2, 3, 4, 5, 7, 9, 11, 13, 16, 17, 19, 23, 25, 29, 31, 37, 41, 43, 47, 49, 53, 59, 61, 67, 71, 73, 79, 81, 83, 89, 97, 101, 103, 107, 109, 113, 121, 127, 128, 131, 137, 139, 149, 151, 157, 163, 167, 169, 173, 179, 181, 191, 193, 197, 199, 210, 211, 223, 227, 229, 233 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS MATHEMATICA f[l_List] := Block[{k = 1, p2 = Times @@@ Subsets[l, {2}], p3 = Times @@@ Subsets[l, {3}]}, While[Intersection[p3, p2*k] != {}, k++ ]; Append[l, k]]; Nest[f, {1, 2, 3}, 62] (*Chandler*) CROSSREFS Cf. A000045, A079850, A079851, compare to A026477. Sequence in context: A089237 A009087 A026477 * A084400 A050376 A050198 Adjacent sequences:  A079849 A079850 A079851 * A079853 A079854 A079855 KEYWORD nonn AUTHOR Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Feb 19 2003 EXTENSIONS Extended by Ray Chandler, Feb 12 2007 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .