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)
page 1

Search completed in 0.001 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 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research