id:A130121 - OEIS Search Results

Search: id:A130121

Displaying 1-1 of 1 results found.

page 1

a(1)=1. a(n) = number of earlier terms of the sequence which divide n(n+1)/2.

+0
2

1, 1, 2, 3, 3, 4, 4, 7, 4, 2, 6, 7, 4, 6, 12, 8, 4, 4, 4, 10, 6, 2, 18, 19, 2, 4, 14, 9, 4, 4, 17, 23, 5, 6, 19, 14, 4, 6, 27, 19, 6, 6, 6, 20, 7, 3, 30, 35, 7, 7, 18, 6, 7, 8, 29, 41, 9, 3, 22, 22, 2, 14, 47, 23, 7, 6, 8, 24, 17, 11, 37, 37, 4, 9, 27, 23, 14, 6, 25, 50, 12, 3, 34, 41, 5, 8, 41 (list; graph; listen)

	OFFSET	`1,3`
	MAPLE	`a[1]:=1: for n from 2 to 110 do a[n]:=0: for j from 1 to n-1 do if type(n*(n+1)/2/a[j], integer)=true then a[n]:=a[n]+1 else fi: od: od: seq(a[n], n=1..110); - Emeric Deutsch (deutsch(AT)duke.poly.edu), May 19 2007`
	CROSSREFS	`Cf. A130120.` `Sequence in context: A105677 A103297 A095916 this_sequence A007898 A110533 A131282` `Adjacent sequences: A130118 A130119 A130120 this_sequence A130122 A130123 A130124`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet (qq-quet(AT)mindspring.com), May 10 2007`
	EXTENSIONS	`More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), May 19 2007`

page 1

Search completed in 0.002 seconds

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.

AT&T Labs Research