id:A053789 - OEIS Search Results

Search: id:A053789

Displaying 1-1 of 1 results found.

page 1

a(n) = A020639(A053790(n)).

+0
2

2, 2, 2, 7, 2, 3, 2, 2, 2, 3, 2, 3, 2, 3, 2, 7, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 41, 2, 3, 2, 3, 2, 3, 2, 3, 2, 59, 2, 7, 2, 3, 2, 3, 2, 7, 2, 37, 2, 2, 5, 2, 2, 89, 2, 3, 2, 3, 2, 7, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 13, 2, 109, 2, 2, 17, 2, 2, 2, 7, 2, 7, 2, 2, 7, 2 (list; graph; listen)

	OFFSET	`1,1`
	EXAMPLE	`a(4) = 7 because the sum of the first 8 primes is 77, and 7 is its least prime divisor.`
	CROSSREFS	`Cf. A013918, A053790, A020639.` `Adjacent sequences: A053786 A053787 A053788 this_sequence A053790 A053791 A053792` `Sequence in context: A098920 A129365 A021453 this_sequence A115596 A029610 A094246`
	KEYWORD	`easy,nonn`
	AUTHOR	`Enoch Haga (Enokh(AT)comcast.net), Mar 27 2000`
	EXTENSIONS	`Edited by njas, Mar 16 2008, following explication by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 26 2008`

page 1

Search completed in 0.002 seconds

Last modified October 12 15:26 EDT 2008. Contains 144830 sequences.

AT&T Labs Research