This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A082287 a(1) = 1; for n>1, n appears omega(n) times, where omega(n)=A001221(n) is the number of distinct prime factors of n, a(1)=1. 2
 1, 2, 3, 4, 5, 6, 6, 7, 8, 9, 10, 10, 11, 12, 12, 13, 14, 14, 15, 15, 16, 17, 18, 18, 19, 20, 20, 21, 21, 22, 22, 23, 24, 24, 25, 26, 26, 27, 28, 28, 29, 30, 30, 30, 31, 32, 33, 33, 34, 34, 35, 35, 36, 36, 37, 38, 38, 39, 39, 40, 40, 41, 42, 42, 42, 43, 44, 44, 45, 45, 46, 46, 47 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS A027748(n) divides a(n) and a(n)=A027748(n) iff a(n) is prime; a(A013939(n)+1)=n. LINKS FORMULA a(n) is the least k such that sum_{p<=k}floor(k/p)>=n where p runs through the primes. [From Benoit Cloitre, Nov 08 2009] PROG (PARI) a(n)=if(n<0, 0, t=1; while(sum(k=1, t, floor(t/prime(k)))

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 .