login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A134190 a(1)=1. a(n) = n*a(n-1) if n*a(n-1) has a fewer number of divisors than n+a(n-1) does. a(n) = n+a(n-1) if n*a(n-1) has a greater or equal number of divisors than n+a(n-1) does. 1
1, 3, 9, 13, 65, 71, 497, 505, 514, 524, 535, 547, 7111, 7125, 106875, 106891, 1817147, 1817165, 34526135, 34526155, 34526176, 34526198, 34526221, 34526245, 34526270, 897683020, 897683047, 897683075, 897683104, 897683134, 897683165, 897683197 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..32.

EXAMPLE

a(6)+7 = 71 + 7 = 78. a(6)*7 = 71 * 7 = 497. 78 has 8 divisors. 497 has 4 divisors. Since 497 has fewer divisors than 78, a(7) is therefore 497.

MATHEMATICA

a = {1}; For[n=2, n < 40, n++, If[Length[Divisors[n*a[[ -1]]]] < Length[Divisors[n+ a[[ -1]]]], AppendTo[a, n*a[[ -1]]], AppendTo[a, n + a[[ -1]]]]]; a (* Stefan Steinerberger, Oct 26 2007 *)

CROSSREFS

Cf. A134189.

Sequence in context: A018292 A089147 A094043 * A047905 A134904 A310324

Adjacent sequences:  A134187 A134188 A134189 * A134191 A134192 A134193

KEYWORD

nonn

AUTHOR

Leroy Quet, Oct 12 2007

EXTENSIONS

More terms from Stefan Steinerberger, Oct 26 2007

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 15 18:26 EDT 2021. Contains 343920 sequences. (Running on oeis4.)