id:A117606 - OEIS Search Results

Search: id:A117606

Displaying 1-1 of 1 results found.

page 1

a(n) = ones digit minus tens digit of the square of a(n-1), with a(0) = 2.

+0
1

2, 4, 5, 3, 9, -7, 5, 3, 9, -7, 5, 3, 9, -7, 5, 3, 9, -7, 5, 3, 9, -7, 5, 3, 9, -7, 5, 3, 9, -7, 5, 3, 9, -7, 5, 3, 9, -7, 5, 3, 9, -7, 5, 3, 9, -7, 5, 3, 9, -7, 5, 3, 9, -7, 5, 3, 9, -7, 5, 3, 9, -7, 5, 3, 9, -7, 5, 3, 9, -7, 5, 3, 9, -7, 5, 3, 9, -7, 5, 3, 9, -7, 5, 3, 9, -7, 5, 3, 9, -7, 5, 3, 9, -7, 5, 3, 9, -7, 5, 3, 9, -7, 5, 3, 9, -7 (list; graph; listen)

	OFFSET	`0,1`
	COMMENT	`From the 2006 Collaborative Problem Solving Contest, written by Tom Clymer. It repeats forever, obviously. If the terms are thought of as the absolute value of the difference of the digits, then the -7s should all be 7 instead, but the remaining terms are unchanged. (The original puzzle sequence had only 2,4,5,3,9 given).`
	LINKS	`National Assessment and Testing, the sponsor of the contest from which this problem comes.` `The 2006 Collaborative Problem Solving Contest, 2006 is the source of this puzzle.`
	EXAMPLE	`Since a(0) = 2, a(1) = 2^2 = 4, and since a(1) = 4, a(2) =` `the difference of the digits of 16 = 5`
	CROSSREFS	`Sequence in context: A026182 A026198 A026206 this_sequence A060736 A097292 A038776` `Adjacent sequences: A117603 A117604 A117605 this_sequence A117607 A117608 A117609`
	KEYWORD	`base,sign`
	AUTHOR	`Joshua Zucker (joshua.zucker(AT)stanfordalumni.org), Apr 06 2006`

page 1

Search completed in 0.002 seconds

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.

AT&T Labs Research