id:A100990 - OEIS Search Results

Search: id:A100990

Displaying 1-1 of 1 results found.

page 1

n^21 mod 100.

+0
2

0, 1, 52, 3, 4, 25, 56, 7, 8, 9, 0, 11, 12, 13, 64, 75, 16, 17, 68, 19, 0, 21, 72, 23, 24, 25, 76, 27, 28, 29, 0, 31, 32, 33, 84, 75, 36, 37, 88, 39, 0, 41, 92, 43, 44, 25, 96, 47, 48, 49, 0, 51, 52, 53, 4, 75, 56, 57, 8, 59, 0, 61, 12, 63, 64, 25, 16, 67, 68, 69, 0, 71, 72, 73, 24 (list; graph; listen)

	OFFSET	`0,3`
	COMMENT	`Also n^(20k+1) mod 100 for any positive integer k.` `There are 63 numbers (075821) where the final two digits of n^21, n^41, n^61, etc. are equal to n.`
	FORMULA	`a(n) = A051126(A010809(n), 100) = a(n-100)`
	EXAMPLE	`a(11)= 11 since 11^21= 7400249944258160101211 and the final two digits are 11.`
	CROSSREFS	`Sequence in context: A135531 A038777 A022079 this_sequence A048365 A033372 A126767` `Adjacent sequences: A100987 A100988 A100989 this_sequence A100991 A100992 A100993`
	KEYWORD	`nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Nov 25 2004`

page 1

Search completed in 0.002 seconds

Last modified July 24 12:00 EDT 2008. Contains 142294 sequences.

AT&T Labs Research