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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A055874 a(n) = largest m such that 1, 2, ..., m divide n. 8
1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 4, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 4, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 4, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 4, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 6, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 4, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 4, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 4, 1, 2, 1, 2 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

EXAMPLE

a(12) = 4 because 1, 2, 3, 4 divide 12.

PROG

Haskell:

a055874 n = length $ takeWhile ((== 0) . (mod n)) [1..]

-- eop.

CROSSREFS

Cf. A055881, A055926.

Sequence in context: A062356 A055881 A204917 * A195155 A178544 A161506

Adjacent sequences:  A055871 A055872 A055873 * A055875 A055876 A055877

KEYWORD

easy,nonn

AUTHOR

Leroy Quet, Jul 16 2000

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 21:13 EST 2012. Contains 206085 sequences.