Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A134189
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A134189 a(1)=1. a(n) = n*a(n-1) if n*a(n-1) has fewer or equal the number of divisors as n+a(n-1) does. a(n) = n+a(n-1) if n*a(n-1) has a greater number of divisors than n+a(n-1) does. +0
2
1, 2, 5, 9, 14, 20, 27, 35, 44, 54, 65, 77, 1001 (list; graph; listen)
OFFSET

1,2

LINKS

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

EXAMPLE

a(12)+13 = 77 + 13 = 90. a(12)*13 = 77 * 13 = 1001. 90 has 12 divisors. 1001 has 8 divisors. Since 1001 has fewer divisors than 90, a(13) is therefore 1001.

CROSSREFS

Cf. A134190.

Sequence in context: A000096 A080956 A132337 this_sequence A109470 A112873 A048093

Adjacent sequences: A134186 A134187 A134188 this_sequence A134190 A134191 A134192

KEYWORD

more,nonn

AUTHOR

Leroy Quet Oct 12 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 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research