Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A157754
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A157754 a(1) = 0, a(n)= LCM[A051904(n),A051903(n)] for n >= 2. +0
2
0, 1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 2, 1, 1, 1, 4, 1, 2, 1, 2, 1, 1, 1, 3, 2, 1, 3, 2, 1, 1, 1, 5, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 2, 2, 1, 1, 4, 2, 2, 1, 2, 1, 3, 1, 3, 1, 1, 1, 2, 1, 1, 2, 6, 1, 1, 1, 2, 1, 1, 1, 6, 1, 1, 2, 2, 1, 1, 1, 4, 4, 1, 1, 2, 1, 1, 1, 3, 1, 2, 1, 2, 1, 1, 1, 5, 1, 2, 2, 2 (list; graph; listen)
OFFSET

1,4

COMMENT

a(n) for n >= 2 equals LCM of minimal and maximal exponents in prime factorization of n. a(n)for n >= 2 it deviates from (A072411), first different term is a(360), a(360) = 3, A072411(360)= 6.

FORMULA

a(1) = 0, a(p) = 1, a(pq) = 1, a(pq...z) = 1, a(p^k) = k, for p = primes (A000040), pq = product of two distinct primes (A006881), pq...z = product of k (k > 2) distinct primes p, q, ..., z (A120944), p^k = prime powers (A000961(n) for n > 1) k = natural numbers (A000027).

EXAMPLE

For n=12=2^2*3^1 the a(12)=LCM(2,1)=2.

CROSSREFS

Cf. A000040, A006881, A120944, A000961, A000027, A072411, A051904, A051903.

Sequence in context: A070013 A070014 A051903 this_sequence A072411 A091050 A005361

Adjacent sequences: A157751 A157752 A157753 this_sequence A157755 A157756 A157757

KEYWORD

nonn

AUTHOR

Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), Mar 05 2009

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 4 15:11 EST 2009. Contains 170347 sequences.


AT&T Labs Research