Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A133454
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A133454 Chain of 6 highly composite numbers generated when subject to the recurrence relation tau(a(n+1)) = a(n),with a(0)=3, where tau(n) is the number-of-divisors function A000005(n). +0
1
4, 6, 12, 60, 5040, 293318625600 (list; graph; listen)
OFFSET

1,1

EXAMPLE

Since 4 is the HCN with 3 divisors, we have tau(4) = 3,and therefore a(1)=4 ; The HCN with 4 divisors is 6, so that tau(6) = 4,and hence a(2)=6 ; The HCN with 6 divisors is 12 so that tau(12) = 6,implying a(3)=12,...

CROSSREFS

Cf. A002182.

Sequence in context: A062624 A050537 A068507 this_sequence A061072 A130435 A028444

Adjacent sequences: A133451 A133452 A133453 this_sequence A133455 A133456 A133457

KEYWORD

fini,full,nonn

AUTHOR

Lekraj Beedassy (blekraj(AT)yahoo.com), Dec 22 2007

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 20:00 EST 2008. Contains 151309 sequences.


AT&T Labs Research