id:A160275 - OEIS Search Results

Search: id:A160275

Displaying 1-1 of 1 results found.

page 1

Partition of positive numbers into shortest possible groups (1), (2,3), (4,5,6), (7,8), ... such that a(n) = the sum of the terms of the n-th group is a multiple of a(n-1).

+0
4

1, 5, 15, 15, 30, 210, 1050, 6300, 1045800, 13756453200, 67826316310678800, 8622353329220210792550912000, 92206830102396929163916671718833533307592704000 (list; graph; listen)

	OFFSET	`1,2`
	FORMULA	`a(n) = A000217(A160277(n)) - A000217(A160277(n-1))`
	CROSSREFS	`Cf. A160276 (ratios a(n)/a(n-1)), A160277 (last terms in the groups), A075631, A079798.` `Sequence in context: A077348 A113259 A166621 this_sequence A015666 A045856 A102185` `Adjacent sequences: A160272 A160273 A160274 this_sequence A160276 A160277 A160278`
	KEYWORD	`nonn`
	AUTHOR	`Max Alekseyev (maxale(AT)gmail.com), May 08 2009`

page 1

Search completed in 0.002 seconds

Last modified December 17 23:40 EST 2009. Contains 171025 sequences.

AT&T Labs Research