This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A241754 Numbers n equal to the sum of all numbers created from permutations of d digits sampled from n, for some d with 1 <= d < length(n). 4
 132, 264, 396, 35964, 4799520, 839991600, 1511984880, 332639667360, 86486391351360, 151351184864880, 46126079538739200, 27427196132572803840, 18050376958194962304000, 7828706350001712936499200, 8540406927274595930726400 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Anthony Sand, Table of n, a(n) for n = 1..22 FORMULA For a number n with d1 digits there are d1Pd2 = d1!/(d1-d2)! substrings generated by sampling and permutating d2 digits from the original number. When n=132 and d2=2, these substrings are 13, 31, 32, 23, 12, 21. When n=112 and d2=2, the substrings are 11, 11, 12, 21, 12, 21. Sum(x,d) is defined as the sum of d-digit substrings for a number x. The sequence above is those numbers such that sum(x,d) = x, where d = 2, 2, 2, 3, 4, 5, 5, 6, 7, 7, 8, 9, 10, 11, 11, 11, 12, 12, 13, 13, 14, 14. EXAMPLE sum(132,2) = 13 + 31 + 32 + 23 + 12 + 21 = 132. CROSSREFS Sequence in context: A253503 A195674 A319274 * A063365 A116869 A035141 Adjacent sequences:  A241751 A241752 A241753 * A241755 A241756 A241757 KEYWORD base,nonn AUTHOR Anthony Sand, Apr 28 2014 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.

Last modified October 15 22:25 EDT 2019. Contains 328038 sequences. (Running on oeis4.)