Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A128367
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A128367 a(n) = least k such that the remainder when 27^k is divided by k is n. +0
13
2, 5, 6, 23, 11, 7, 25, 19, 10, 17, 718, 165, 35, 533, 33 (list; graph; listen)
OFFSET

1,1

CROSSREFS

Cf. A128361, A128362, A128363, A128364, A128365, A128366, 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: A098871 A014454 A136324 this_sequence A137067 A008555 A105605

Adjacent sequences: A128364 A128365 A128366 this_sequence A128368 A128369 A128370

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 September 5 19:27 EDT 2008. Contains 143485 sequences.


AT&T Labs Research