login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A205108 Least s(k) such that n divides s(k)-s(j) for some j<k, where s(j)=3^j-2^j. 2
5, 5, 19, 5, 65, 19, 19, 65, 19, 65, 665, 65, 2059, 19, 65, 65, 665, 19, 665, 65, 211, 665, 65, 211, 665, 2059, 19171, 2059, 1586131, 65, 19171, 65, 665, 665, 211, 6305, 19171, 665, 6305, 665, 2059, 211, 527345, 665, 6305, 65, 6305, 211, 2059, 665 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
For a guide to related sequences, see A204892.
LINKS
MATHEMATICA
(See the program at A205000.)
CROSSREFS
Sequence in context: A255445 A255454 A255443 * A146032 A147093 A147101
KEYWORD
nonn
AUTHOR
Clark Kimberling, Jan 22 2012
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 1 22:05 EDT 2024. Contains 375597 sequences. (Running on oeis4.)