login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A128305 a(n) = smallest m such that g(m) is divisible by prime(n), where g is Landau's function A000793. 2
2, 3, 8, 14, 27, 32, 57, 62, 93, 118, 128, 178, 213, 215, 297, 346, 399, 429, 519, 510, 586, 687, 780 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

EXAMPLE

g(k) for k < 14 is not divisible by prime(4) = 7; g(14) = 84 = 7*12. Hence a(4) = 14.

g(k) for k < 32 is not divisible by prime(6) = 13; g(32) = 5460 = 13*420. Hence a(6) = 32.

CROSSREFS

Cf. A000793.

Sequence in context: A022951 A171237 A173149 * A201361 A129700 A197466

Adjacent sequences:  A128302 A128303 A128304 * A128306 A128307 A128308

KEYWORD

nonn,more

AUTHOR

Anthony C Robin (anthony_robin(AT)hotmail.com), May 04 2007

EXTENSIONS

Edited, a(6) inserted and a(12) to a(23) added by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), May 07 2007

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 .

Last modified February 14 23:53 EST 2012. Contains 205689 sequences.