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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A125072 a(n) = number of exponents in the prime-factorization of n which are triangular numbers. 1
0, 1, 1, 0, 1, 2, 1, 1, 0, 2, 1, 1, 1, 2, 2, 0, 1, 1, 1, 1, 2, 2, 1, 2, 0, 2, 1, 1, 1, 3, 1, 0, 2, 2, 2, 0, 1, 2, 2, 2, 1, 3, 1, 1, 1, 2, 1, 1, 0, 1, 2, 1, 1, 2, 2, 2, 2, 2, 1, 2, 1, 2, 1, 1, 2, 3, 1, 1, 2, 3, 1, 1, 1, 2, 1, 1, 2, 3, 1, 1, 0, 2, 1, 2, 2, 2, 2, 2, 1, 2, 2, 1, 2, 2, 2, 1, 1, 1, 1, 0, 1, 3, 1, 2, 3 (list; graph; refs; listen; history; internal format)
OFFSET

1,6

EXAMPLE

The prime-factorzation of 360 is 2^3 *3^2 *5^1. There are two exponents in this factorization which are triangular numbers, 1 and 3. So a(360) = 2.

MATHEMATICA

f[n_] := Length @ Select[Last /@ FactorInteger[n], IntegerQ[Sqrt[8# + 1]] &]; Table[f[n], {n, 110}] (*Chandler*)

CROSSREFS

Cf. A125073.

Sequence in context: A078134 A083661 A029369 * A162642 A139146 A144032

Adjacent sequences:  A125069 A125070 A125071 * A125073 A125074 A125075

KEYWORD

nonn

AUTHOR

Leroy Quet, Nov 18 2006

EXTENSIONS

Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Nov 19 2006

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 16 10:07 EST 2012. Contains 205904 sequences.