login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A054703 Number of distinct powers of 2 modulo n. 1
1, 2, 2, 3, 4, 3, 3, 4, 6, 5, 10, 4, 12, 4, 4, 5, 8, 7, 18, 6, 6, 11, 11, 5, 20, 13, 18, 5, 28, 5, 5, 6, 10, 9, 12, 8, 36, 19, 12, 7, 20, 7, 14, 12, 12, 12, 23, 6, 21, 21, 8, 14, 52, 19, 20, 6, 18, 29, 58, 6, 60, 6, 6, 7, 12, 11, 66, 10, 22, 13, 35, 9, 9, 37, 20, 20, 30, 13, 39, 8, 54 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000

CROSSREFS

Sequence in context: A144909 A117114 A126688 * A048206 A075765 A181024

Adjacent sequences:  A054700 A054701 A054702 * A054704 A054705 A054706

KEYWORD

easy,nonn

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Apr 20 2000

EXTENSIONS

Improved definition from T. D. Noe, Jul 21 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 20:50 EST 2012. Contains 206085 sequences.