Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A141286
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A141286 a(n) = the smallest positive multiple of n such that a(n) is divisible by A001222(a(n)), where A001222(m) is the sum of the exponents in the prime factorization of m. +0
1
2, 2, 3, 4, 5, 6, 7, 16, 18, 10, 11, 12, 13, 14, 30, 16, 17, 18, 19, 40, 42, 22, 23, 24, 75 (list; graph; listen)
OFFSET

1,1

EXAMPLE

For n = 25, checking: 1*25 = 25 = 5^2. The sum of the exponents in the prime-factorization of 5^2 is 2. 2 does not divide 25. 2*25 = 50 = 2^1 *5^2. The sum of the exponents is 1+2=3. 3 does not divide 50. 3*25 = 75 = 3^1 *5^2. The sum of the exponents is 3. Now, 3 does divide 75. So a(25) = 75.

CROSSREFS

Cf. A001222.

Sequence in context: A100665 A114095 A066639 this_sequence A025209 A125573 A034139

Adjacent sequences: A141283 A141284 A141285 this_sequence A141287 A141288 A141289

KEYWORD

more,nonn

AUTHOR

Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Aug 01 2008

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 December 2 15:58 EST 2008. Contains 150992 sequences.


AT&T Labs Research