The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A169819 a(n) = total number of distinct divisors of n and all of its substrings. 3

%I

%S 1,2,2,3,2,4,2,4,3,5,2,6,3,5,4,7,3,8,4,7,5,4,4,8,4,6,6,7,5,9,3,7,4,6,

%T 5,9,4,7,5,9,4,9,5,6,8,7,5,10,7,7,5,7,4,10,4,11,6,7,5,13,5,6,8,9,7,8,

%U 6,9,7,9,3,13,4,6,7,9,4,11,5,11,8,6,6,13,7,8,8,8,7,13,6,8,5,7,6,13,5,10,6

%N a(n) = total number of distinct divisors of n and all of its substrings.

%C Note that we are counting 0 when it occurs as a digit of n, but are not counting any other integers as divisors of 0. (If we did, there would be infinitely many of them; every integer divides 0.) [From _Franklin T. Adams-Watters_, May 29 2010]

%e a(56) = 11 because divisors of 56 are d1= {1, 2, 4, 7, 8, 14, 28, 56}; 56 has two substrings 5,6; divisors of 5 are d2= {1, 5}, and divisors of 6 are d3= {1, 2, 3,6} ; union of d1,d2,d3 gives 11 distinct divisors of 56 and all of its substrings: {1, 2, 3, 4, 5, 6, 7, 8, 14, 28, 56}.

%t Table[id = IntegerDigits[n]; FLA = Flatten[Table[Partition[id, k, 1], {k, Length[id]}], 1]; fd = Union[FromDigits /@ FLA]; dv = Length[Union[Flatten[Divisors /@ fd]]], {n, 200}]

%Y Cf. A177834

%K base,nonn

%O 1,2

%A _Zak Seidov_, May 28 2010

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.

Last modified December 2 09:48 EST 2020. Contains 338876 sequences. (Running on oeis4.)