Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A171726
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A171726 Number of n-digit numbers m such that (a) the digits of m are from the set {1, 2, 3, 4, 5},(b) any digit that appears in m appears at least twice. +0
1
0, 5, 5, 65, 205, 1405, 7425, 44385, 271205, 1666925, 10312945 (list; graph; listen)
OFFSET

1,2

COMMENT

All numbers are divisible by 5. Cf. A171725 (n=6 case).

EXAMPLE

a(1)=0 triivially

a(2)=5 because the are 5 eligible numbers 11, 22, 33, 44, 55

a(3)=5 because the are 5 eligible numbers 111,.222, 333,444, 555

a(4)=65 because the are 65 eligible numbers:

1111,1122,1133,1144,1155,1212,1221,1313,1331,1414,1441,1515,1551,

2112,2121,2211,2222,2233,2244,2255,2323,2332,2424,2442,2525,2552,

3113,3131,3223,3232,3311,3322,3333,3344,3355,3434,3443,3535,3553,

4114,4141,4224,4242,4334,4343,4411,4422,4433,4444,4455,4545,4554,

5115,5151,5225,5252,5335,5353,5445,5454,5511,5522,5533,5544,5555.

CROSSREFS

Sequence in context: A009390 A009334 A151467 this_sequence A129358 A151492 A081050

Adjacent sequences: A171723 A171724 A171725 this_sequence A171727 A171728 A171729

KEYWORD

base,nonn

AUTHOR

Zak Seidov (zakseidov(AT)yahoo.com), Dec 16 2009

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 18 15:35 EDT 2010. Contains 173617 sequences.


AT&T Labs Research