Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A053422
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A053422 n times (n 1's): n*(10^n - 1)/9. +0
8
0, 1, 22, 333, 4444, 55555, 666666, 7777777, 88888888, 999999999, 11111111110, 122222222221, 1333333333332, 14444444444443, 155555555555554, 1666666666666665, 17777777777777776, 188888888888888887, 1999999999999999998, 21111111111111111109, 222222222222222222220, 2333333333333333333331 (list; graph; listen)
OFFSET

0,3

COMMENT

R_a(n) is the least repunit divisible by the square of R_n = (10^n - 1)/9. - Lekraj Beedassy (blekraj(AT)yahoo.com), Jun 07 2006

FORMULA

a(n) = n*A002275(n) = a(n-1)*10n/(n-1)+n

O.g.f.: -x(-1+10x^2)/((-1+x)^2*(-1+10x)^2) . - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 21 2008

PROGRAM

(Other) sage: [gaussian_binomial(n, 1, 10)*n for n in xrange(0, 22)] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 29 2009]

CROSSREFS

Cf. A000461, A048376.

Sequence in context: A025936 A158849 A048376 this_sequence A000461 A048795 A068186

Adjacent sequences: A053419 A053420 A053421 this_sequence A053423 A053424 A053425

KEYWORD

base,easy,nonn

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Mar 07 2000

EXTENSIONS

Corrected by Jason Earls (zevi_35711(AT)yahoo.com), Sep 02 2006

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 | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 20 00:58 EST 2009. Contains 171054 sequences.


AT&T Labs Research