id:A161660 - OEIS Search Results

Search: id:A161660

Displaying 1-1 of 1 results found.

page 1

a(1)=1. a(n) = largest multiple of {number of divisors of a(n-1)} that is <= n.

+0
2

1, 2, 2, 4, 3, 6, 4, 6, 8, 8, 8, 12, 12, 12, 12, 12, 12, 18, 18, 18, 18, 18, 18, 24, 24, 24, 24, 24, 24, 24, 24, 32, 30, 32, 30, 32, 36, 36, 36, 36, 36, 36, 36, 36, 45, 42, 40, 48, 40, 48, 50, 48, 50, 54, 48, 50, 54, 56, 56, 56, 56, 56, 56, 64, 63, 66, 64, 63, 66, 64, 70, 72, 72 (list; graph; listen)

	OFFSET	`1,2`
	EXAMPLE	`Contribution from Emeric Deutsch (deutsch(AT)duke.poly.edu), Jun 27 2009: (Start)` `a(18)=18 because a(17)=12 has 6 divisors and largest multiple of 6 not exceeding 18 is 18.` `(End)`
	MAPLE	`with(numtheory): a[1] := 1: for n from 2 to 80 do for j while jtau(a[n-1]) <= n do end do: a[n] := (j-1)tau(a[n-1]) end do: seq(a[n], n = 1 .. 80); [From Emeric Deutsch (deutsch(AT)duke.poly.edu), Jun 27 2009]`
	CROSSREFS	`A161661` `Sequence in context: A067240 A126080 A060681 this_sequence A060766 A029578 A054345` `Adjacent sequences: A161657 A161658 A161659 this_sequence A161661 A161662 A161663`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Jun 15 2009`
	EXTENSIONS	`Extended by Emeric Deutsch (deutsch(AT)duke.poly.edu), Jun 27 2009`

page 1

Search completed in 0.002 seconds

Last modified December 20 16:54 EST 2009. Contains 171081 sequences.

AT&T Labs Research