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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A272181 a(1) = 1; a(n) = n mod a(k), k being the largest value such that n mod a(k) > 1, or n if there is no such k. 1
1, 2, 3, 2, 2, 6, 7, 2, 2, 3, 2, 5, 3, 2, 3, 2, 2, 3, 4, 2, 3, 2, 2, 4, 4, 2, 3, 3, 2, 2, 3, 2, 3, 2, 2, 36, 2, 2, 3, 4, 2, 2, 3, 2, 9, 2, 2, 3, 4, 2, 3, 7, 4, 2, 3, 2, 3, 2, 2, 4, 5, 2, 3, 4, 2, 2, 3, 2, 4, 2, 3, 2, 3, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Cody M. Haderlie, Table of n, a(n) for n = 1..100000

EXAMPLE

a(5) = 2; k = 3 and 5 mod a(3) = 2.

CROSSREFS

Sequence in context: A214320 A119809 A007653 * A154179 A300862 A151863

Adjacent sequences:  A272178 A272179 A272180 * A272182 A272183 A272184

KEYWORD

nonn

AUTHOR

Cody M. Haderlie, Apr 21 2016

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 18 02:23 EDT 2019. Contains 328135 sequences. (Running on oeis4.)