id:A085767 - OEIS Search Results

Search: id:A085767

Displaying 1-1 of 1 results found.

page 1

Smallest m such that n divides the pentagonal number A000326(m).

+0
1

1, 3, 3, 3, 2, 3, 5, 11, 9, 7, 4, 3, 9, 7, 12, 11, 6, 27, 13, 27, 12, 4, 8, 27, 17, 35, 27, 19, 10, 12, 21, 43, 15, 23, 5, 27, 25, 19, 9, 27, 14, 12, 29, 11, 27, 8, 16, 75, 33, 67, 6, 35, 18, 27, 15, 75, 51, 39, 20, 27, 41, 31, 54, 43, 22, 15, 45, 40, 54, 7, 24, 27, 49, 99, 42, 19, 26, 39 (list; graph; listen)

	OFFSET	`1,2`
	EXAMPLE	`Let pe(m)=m*(3m-1)/2. The pe(1)=1, pe(2)=5, pe(3)=12. As pe(3) is the first divisible by 6, a(6)=3.`
	PROGRAM	`(PARI) pe(n)=n(3n-1)/2 for (n=1, 50, c=1; while (pe(c)%n!=0, c++); print1(c", "))`
	CROSSREFS	`Cf. A011772 (triangular numbers), A019554 (squares).` `Adjacent sequences: A085764 A085765 A085766 this_sequence A085768 A085769 A085770` `Sequence in context: A075074 A166007 A087497 this_sequence A082127 A031354 A033700`
	KEYWORD	`nonn`
	AUTHOR	`Jon Perry (perry(AT)globalnet.co.uk), Jul 22 2003`
	EXTENSIONS	`More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Feb 10 2005`

page 1

Search completed in 0.002 seconds

Last modified November 8 20:39 EST 2009. Contains 166234 sequences.

AT&T Labs Research