

A051883


a(n) is the smallest number such that the concatenation of a(1)a(2)a(3)...a(n) is divisible by n.


12



1, 0, 2, 0, 0, 0, 5, 6, 4, 0, 5, 16, 2, 4, 0, 0, 14, 4, 9, 20, 16, 26, 13, 6, 25, 22, 34, 4, 14, 0, 17, 28, 42, 22, 20, 24, 31, 44, 36, 0, 15, 24, 2, 8, 20, 36, 8, 16, 32, 50, 35, 6, 47, 58, 40, 16, 4, 26, 12, 40, 51, 52, 38, 4, 5, 12, 74, 56, 2, 20, 11, 68, 44, 58, 75, 24, 7, 38, 87, 20
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,3


REFERENCES

A. Murthy, Exploring some new ideas on Smarandache type sets, functions and sequences, Smarandache Notions Journal Vol. 11, N 123 Spring 2000


LINKS

Paul Tek, Table of n, a(n) for n = 1..10000


EXAMPLE

For example the third term is 2 because 102 is divisible by 3.


PROG

(Haskell)
import Data.List (findIndex)
import Data.Maybe (fromJust)
a051883 n = a051883_list !! (n1)
a051883_list = 1 : f 2 "1" where
f :: Integer > String > [Int]
f x zs = y : f (x + 1) (zs ++ show y) where
y = fromJust $ findIndex
((== 0) . (`mod` x) . read . (zs ++)) $ map show [0..]
 Reinhard Zumkeller, May 26 2013


CROSSREFS

See A082399 for another version.
Sequence in context: A222898 A113044 A082399 * A132792 A136572 A262679
Adjacent sequences: A051880 A051881 A051882 * A051884 A051885 A051886


KEYWORD

nonn,easy,nice,base


AUTHOR

Felice Russo, Dec 15 1999


EXTENSIONS

Expanded and corrected from the Murthy paper.
More terms from Michael Lugo (mlugo(AT)thelabelguy.com), Dec 22 1999
Further terms from David Wasserman, Mar 05 2002


STATUS

approved



