id:A117061 - OEIS Search Results

Search: id:A117061

Displaying 1-1 of 1 results found.

page 1

Numbers n such that a(n)=(s(n-1))^2+n, with a(1)=1.

+0
1

1, 3, 12, 13, 21, 15, 43, 57, 153, 91, 111, 21, 22, 30, 24, 52, 66, 162, 100, 21, 30, 31, 39, 168, 250, 75, 171, 109, 129, 174, 175, 201, 42, 70, 84, 180, 118, 138, 183, 184, 210, 51, 79, 300, 54, 127, 147, 192, 193, 219, 195, 277, 309, 198, 379, 417, 201, 67, 228, 204 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`From a puzzle : 1 3 12 13 21 15 43 .?. 153 answer : 57 Each number can be found by squaring the sum of the digits of the previous number and then adding the indexnumber.`
	FORMULA	`a(n)= s(n-1))^2+n, where s(n) stands for the sum of the digits of a(n)`
	CROSSREFS	`Sequence in context: A024546 A073542 A063444 this_sequence A089919 A032918 A039945` `Adjacent sequences: A117058 A117059 A117060 this_sequence A117062 A117063 A117064`
	KEYWORD	`base,easy,nonn`
	AUTHOR	`Luc Stevens (lms022(AT)yahoo.com), Apr 16 2006`

page 1

Search completed in 0.004 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research