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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A034837 Numbers that are divisible by first digit. 8
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 24, 26, 28, 30, 33, 36, 39, 40, 44, 48, 50, 55, 60, 66, 70, 77, 80, 88, 90, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

FORMULA

a(n) mod A000030(a(n)) = 0. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Sep 20 2003

PROG

(Haskell)

import Data.Char (digitToInt)

a034837 n = a034837_list !! (n-1)

a034837_list = filter (\i -> i `mod` (a000030 i) == 0) [1..]

-- Reinhard Zumkeller, Jun 19 2011

(PARI) for(n=1, 1000, n%(Vecsmall(Str(n))[1]-48)|print1(n", "))  \\ - M. F. Hasler, Jun 19 2011

(PARI) a(n)=for(k=1, 1e9, k%(Vecsmall(Str(k))[1]-48)|n--|return(k))  \\ - M. F. Hasler, Jun 19 2011

CROSSREFS

Sequence in context: A135579 A138234 A032520 * A096105 A178157 A175782

Adjacent sequences:  A034834 A034835 A034836 * A034838 A034839 A034840

KEYWORD

nonn,base,nice

AUTHOR

Erich Friedman (erich.friedman(AT)stetson.edu)

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 16 21:51 EST 2012. Contains 205978 sequences.