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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A055098 Number of distinct anagrams of digits of n without leading zeros. 5
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 1, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 1, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,12

LINKS

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

EXAMPLE

a(101)=2 since the digits of 101 can be ordered 101 or 110 (but not 011)

MATHEMATICA

a[n_] := Length[ DeleteCases[ Permutations[ IntegerDigits[n]], {0 .., __}]]; Table[a[n], {n, 1, 102}] (* Jean-Fran├žois Alcover, Nov 30 2011 *)

PROG

(Haskell)

import Data.List (permutations, nub)

a055098 n = length $ nub $ filter ((> '0') . head) $ permutations $ show n

-- Reinhard Zumkeller, Aug 14 2011

CROSSREFS

Cf. A046810, A047726.

Sequence in context: A138471 A102669 A248327 * A297035 A055178 A174847

Adjacent sequences:  A055095 A055096 A055097 * A055099 A055100 A055101

KEYWORD

base,easy,nice,nonn

AUTHOR

Henry Bottomley, Apr 19 2000

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 22 22:34 EDT 2019. Contains 328335 sequences. (Running on oeis4.)