Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A128305
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A128305 a(n) = smallest m such that g(m) is divisible by prime(n), where g is Landau's function A000793. +0
3
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; listen)
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: A145929 A153865 A022951 this_sequence A129700 A049344 A080877

Adjacent sequences: A128302 A128303 A128304 this_sequence 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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research