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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A095827 a(n) is the smallest k such that ((A007953)^k)(9n)=9. 0
0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2 (list; graph; refs; listen; history; internal format)
OFFSET

1,11

COMMENTS

The first occurrence of a 3 is a(11111111111).

CROSSREFS

Sequence in context: A167852 A184340 A083911 * A193582 A091887 A144871

Adjacent sequences:  A095824 A095825 A095826 * A095828 A095829 A095830

KEYWORD

base,easy,nonn

AUTHOR

Paul Boddington (psb(AT)maths.warwick.ac.uk), Jul 10 2004

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 14 17:27 EST 2012. Contains 205644 sequences.