id:A144544 - OEIS Search Results

Search: id:A144544

Displaying 1-1 of 1 results found.

page 1

Unique sequence of digits a(0), a(1), a(2), .. such that for all k >= 2, the number A(k) := Sum_{n = 0..k-1 } a(n)*10^n satisfies 16^A(k) == A(k) mod 10^k.

+0
3

6, 1, 6, 5, 1, 4, 0, 9, 2, 0, 5, 9, 4, 0, 5, 7, 0, 1, 8, 7, 6, 6, 3, 2, 8, 6, 2, 2, 5, 8, 4, 6, 2, 0, 8, 8, 3, 8, 0, 0, 5, 6, 9, 9, 8, 2, 5, 2, 1, 1, 7, 8, 5, 3, 3, 6, 7, 3, 2, 1, 7, 8, 3, 7, 0, 0, 2, 6 (list; graph; listen)

	OFFSET	`0,1`
	REFERENCES	`J. Jimenez Urroz and J. Luis A. Yebra, On the equation a^x == x (mod b^n), Preprint, Oct 28 2008.`
	CROSSREFS	`Cf. A133612-A133619 and A144539-A144543.` `Sequence in context: A109918 A096956 A010492 this_sequence A070514 A070472 A151784` `Adjacent sequences: A144541 A144542 A144543 this_sequence A144545 A144546 A144547`
	KEYWORD	`nonn,base`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Dec 20 2008`

page 1

Search completed in 0.002 seconds

Last modified December 1 13:27 EST 2009. Contains 167806 sequences.

AT&T Labs Research