Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A146288
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A146288 Number of divisors of the nth prime signature number (A025487(n)). +0
3
1, 2, 3, 4, 4, 6, 5, 8, 8, 6, 9, 10, 12, 7, 12, 12, 16, 8, 15, 18, 14, 16, 16, 20, 9, 18, 24, 16, 24, 20, 24, 10, 21, 30, 18, 32, 24, 27, 28, 11, 32, 24, 36, 25, 36, 20, 40, 28, 36, 32, 12, 40, 27, 32, 48, 30, 42, 22, 48, 32, 45, 36, 13, 48, 30, 48, 60, 35, 48, 48, 24, 54, 50, 56 (list; graph; listen)
OFFSET

1,2

FORMULA

If A025487(n)'s canonical factorization into prime powers is Product p^e(p), then a(n) = Product (e(p) + 1).

EXAMPLE

a(4)=4 because 4 positive integers divide evenly into A025487(4)=6: 1, 2, 3 and 6.

CROSSREFS

For the number of divisors of n, see A000005.

a(n) = sum of the nth row of A146290, A146292.

A rearrangement of A080444.

Sequence in context: A063655 A117248 A079788 this_sequence A064553 A126012 A096908

Adjacent sequences: A146285 A146286 A146287 this_sequence A146289 A146290 A146291

KEYWORD

nonn

AUTHOR

Matthew Vandermast (ghodges14(AT)comcast.net), Nov 11 2008

page 1

Search completed in 0.005 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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research