This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A097214 Numbers n such that A076078(n) = n, where A076078(n) equals the number of sets of distinct positive integers with a least common multiple of n. 2
 1, 2, 4, 8, 10, 16, 32, 44, 64, 128, 184, 256, 512, 752, 1024, 2048, 4096, 8192, 12224, 16384, 32768, 49024, 61064, 65536, 131072, 262124, 524288, 981520, 1048576, 2097152, 4194304, 8388608, 12580864, 16777216, 33554432, 67108864, 134217728 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Contains all powers of 2 (A000079). Union of A000079 and A097215. If 3*2^n-1 is prime then 2^n*(3*2^n-1) is in the sequence. So 2^A002235*(3*2^A002235-1) is a subsequence of this sequence. - Farideh Firoozbakht, Aug 06 2005 LINKS EXAMPLE A total of 10 sets of distinct positive integers have a least common multiple of 10: 1,2,5; 1,2,5,10; 1,2,10; 1,5,10; 1,10; 2,5; 2,5,10; 2,10; 5,10; and 10. Hence 10 is in the sequence. CROSSREFS Cf. A097215 Cf. A002235. Sequence in context: A083655 A271816 A097210 * A045579 A177050 A276772 Adjacent sequences:  A097211 A097212 A097213 * A097215 A097216 A097217 KEYWORD nonn AUTHOR Matthew Vandermast, Aug 12 2004 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 December 14 14:50 EST 2019. Contains 329979 sequences. (Running on oeis4.)