Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A128366
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A128366 a(n) = least k such that the remainder when 26^k is divided by k is n. +0
13
5, 3, 23, 6, 7, 10, 19, 9, 17, 18, 15, 92, 18881, 319, 36091, 20, 203, 94, 49, 21, 42395, 42, 17553, 326, 106709, 27 (list; graph; listen)
OFFSET

1,1

CROSSREFS

Cf. A128361, A128362, A128363, A128364, A128365, 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.

Adjacent sequences: A128363 A128364 A128365 this_sequence A128367 A128368 A128369

Sequence in context: A091593 A139699 A069607 this_sequence A083756 A032532 A111108

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 October 7 08:31 EDT 2008. Contains 144667 sequences.


AT&T Labs Research