id:A151546 - OEIS Search Results

Search: id:A151546

Displaying 1-1 of 1 results found.

page 1

When computing A160256(n), it must be a multiple of a(n).

+0
2

1, 2, 3, 2, 3, 8, 9, 8, 3, 2, 6, 1, 6, 5, 12, 5, 12, 1, 60, 7, 60, 7, 60, 7, 60, 7, 60, 7, 60, 1, 420, 11, 420, 11, 420, 11, 420, 11, 420, 11, 420, 11, 420, 11, 420, 22, 378, 55, 126, 55, 63, 220, 63, 440, 189, 880, 567, 880, 189, 220, 63, 55, 252, 275, 252, 275, 336, 275, 84, 275, 84 (list; graph; listen)

	OFFSET	`3,2`
	COMMENT	`In other words, a(n) = numerator of b(n-2)/b(n-1), where b() = A160256().` `Then b(n) = smallest multiple of a(n) not already present in A160256.`
	LINKS	`Alois P. Heinz, Table of n, a(n) for n = 3..10000`
	MAPLE	`bb:= proc(n) option remember; false end: b:= proc(n) option remember; local k, m; if n<3 then bb(n):= true; n else m:= denom (b(n-1) /b(n-2)); for k from m by m while bb(k) do od; bb(k):= true; k fi end: a:= n-> numer (b(n-2) /b(n-1)): seq (a(n), n=3..100); [From Alois P. Heinz (heinz(AT)hs-heilbronn.de), May 17 2009]`
	CROSSREFS	`Sequence in context: A076731 A085216 A102310 this_sequence A117936 A078331 A093868` `Adjacent sequences: A151543 A151544 A151545 this_sequence A151547 A151548 A151549`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), May 16 2009`

page 1

Search completed in 0.002 seconds

Last modified November 25 08:46 EST 2009. Contains 167481 sequences.

AT&T Labs Research