id:A101776 - OEIS Search Results

Search: id:A101776

Displaying 1-1 of 1 results found.

page 1

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

+0
4

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; listen)

	OFFSET	`0,2`
	COMMENT	`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: A013940 A029129 A087842 this_sequence A047745 A121536 A080405` `Adjacent sequences: A101773 A101774 A101775 this_sequence A101777 A101778 A101779`
	KEYWORD	`nonn`
	AUTHOR	`Ray Chandler (rayjchandler(AT)sbcglobal.net), Jan 10 2005`

page 1

Search completed in 0.002 seconds

Last modified November 30 22:12 EST 2008. Contains 150989 sequences.

AT&T Labs Research