Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A143525
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A143525 a(n) = the number of divisors of (A005179(n)-1), where A005179(n) is the smallest positive integer with n divisors. +0
2
1, 2, 2, 4, 2, 6, 2, 4, 2, 8, 2, 24, 2, 4, 4, 16, 2, 32, 2, 6, 4, 16, 2, 8, 4, 4, 4, 64, 2, 96, 2, 8, 4, 4, 2, 512, 2, 4, 4, 192, 2, 144, 2, 4, 6, 16, 4, 16, 8, 8, 8, 128, 2, 12, 2, 16, 4, 64, 2, 4608, 4, 12, 2, 12, 8, 384, 4, 8, 2, 512, 2, 8192, 16, 4, 16, 8, 8, 192, 4, 8, 4, 32, 4, 24, 8 (list; graph; listen)
OFFSET

2,2

LINKS

Leroy Quet, Home Page (listed in lieu of email address)

FORMULA

a(n) = A000005(A005179(n)-1). [From Ray Chandler (rayjchandler(AT)sbcglobal.net), Oct 11 2008]

CROSSREFS

Cf. A005179, A143526.

Sequence in context: A133181 A090397 A054704 this_sequence A082174 A074369 A073348

Adjacent sequences: A143522 A143523 A143524 this_sequence A143526 A143527 A143528

KEYWORD

nonn

AUTHOR

Leroy Quet Aug 22 2008

EXTENSIONS

Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Oct 11 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 November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research