Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A128365
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A128365 a(n) = least k such that the remainder when 25^k is divided by k is n. +0
13
2, 23, 11, 7, 10, 19, 57, 17, 14, 15, 614, 13, 34 (list; graph; listen)
OFFSET

1,1

CROSSREFS

Cf. A128361, A128362, A128363, A128364, A128366, A128367, A128368, A128369, A129370, A128371, A128372. Cf. A036236, A078457, A119678, A119679, A127816, A119715, A119714, A127817, A127818, A127819, A127820, A127821, A128154, A128155, A128156, A128157, A128158, A128159, A128160. Cf. A128149, A128150, A128172.

Sequence in context: A110354 A120713 A104644 this_sequence A016837 A084323 A131983

Adjacent sequences: A128362 A128363 A128364 this_sequence A128366 A128367 A128368

KEYWORD

hard,more,nonn

AUTHOR

Alexander Adamchuk (alex(AT)kolmogorov.com), Feb 27 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research