Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A128372
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A128372 a(n) = least k such that the remainder when 32^k is divided by k is n. +0
13
31, 3, 29, 6, 201, 13, 25, 9, 23, 11, 183, 22, 19, 159, 17, 20, 45, 49, 169, 502, 209, 42, 35, 50, 91919, 27, 3265, 36, 1159, 98, 75197, 33, 95, 66, 2817, 38, 1385, 58, 25187, 82, 32727, 982, 55, 117, 7031, 91, 2517, 52 (list; graph; listen)
OFFSET

1,1

CROSSREFS

Cf. A128361, A128362, A128363, A128364, A128365, A128366, A128367, A128368, A129369, A128370, A128371. 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: A128369 A128370 A128371 this_sequence A128373 A128374 A128375

Sequence in context: A050101 A107811 A109837 this_sequence A040942 A040943 A040944

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 11 13:47 EDT 2008. Contains 144830 sequences.


AT&T Labs Research