A101776 - OEIS

This site is supported by donations to The OEIS Foundation.

A101776

Smallest k such that k^2 is equal to the sum of n not-necessarily-distinct primes plus 1.

1, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,2`
	COMMENTS	`Pattern appears to be: one 1, one 2, three 3's, three 4's, ..., (2k+1) (2k+1)'s, (2k+1) (2k+2)'s.`
	FORMULA	`a(n) = Sqrt(A100555(n)).`
	CROSSREFS	`Cf. A100555, A101777-A101778.` `Sequence in context: A029129 A087842 A201206 * A189721 A202304 A047745` `Adjacent sequences: A101773 A101774 A101775 * A101777 A101778 A101779`
	KEYWORD	`nonn`
	AUTHOR	`Ray Chandler (rayjchandler(AT)sbcglobal.net), Jan 10 2005`

Content is available under The OEIS End-User License Agreement .

Last modified February 17 10:57 EST 2012. Contains 206009 sequences.