id:A084795 - OEIS Search Results

Search: id:A084795

Displaying 1-1 of 1 results found.

page 1

a(n) = floor( 1/frac(n*(Pi)^2/6) ).

+0
1

1, 3, 1, 1, 4, 1, 1, 6, 1, 2, 10, 1, 2, 34, 1, 3, 1, 1, 3, 1, 1, 5, 1, 2, 8, 1, 2, 17, 1, 2, 1, 1, 3, 1, 1, 4, 1, 1, 6, 1, 2, 11, 1, 2, 45, 1, 3, 1, 1, 4, 1, 1, 5, 1, 2, 8, 1, 2, 19, 1, 2, 1, 1, 3, 1, 1, 4, 1, 1, 6, 1, 2, 12, 1, 2, 66, 1, 3, 1, 1, 4, 1, 1, 5, 1, 2, 9, 1, 2, 22, 1, 2, 1, 1, 3, 1, 1, 4, 1, 2, 7, 1 (list; graph; listen)

	OFFSET	`1,2`
	PROGRAM	`(PARI) x=(Pi)^2/6; for(n=1, 60, t=floor( 1/frac(n*x) ); print1(t", "))`
	CROSSREFS	`Sequence in context: A000503 A111956 A024564 this_sequence A030184 A104610 A138684` `Adjacent sequences: A084792 A084793 A084794 this_sequence A084796 A084797 A084798`
	KEYWORD	`nonn`
	AUTHOR	`Paul D. Hanna (pauldhanna(AT)juno.com), Jun 03 2003`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research