Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A095865
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A095865 Smallest n-digit triangular number - smallest n-digit number. +0
7
0, 0, 5, 35, 11, 128, 405, 1628, 5153, 6281, 20331, 404505, 1326005, 2437316, 12392316, 42485480, 37150046, 18810, 179470703, 2237948990, 10876002500, 22548781025, 26940078203, 242416922750, 572687476751, 4117080477500 (list; graph; listen)
OFFSET

1,3

FORMULA

a(n) = A068093(n) - 10^(n-1).

CROSSREFS

Cf. A068092, A068093, A068094, A095863, A095864, A095866.

Sequence in context: A054931 A130607 A086345 this_sequence A087675 A128044 A014632

Adjacent sequences: A095862 A095863 A095864 this_sequence A095866 A095867 A095868

KEYWORD

base,easy,nonn

AUTHOR

Ray Chandler (rayjchandler(AT)sbcglobal.net), Jun 28 2004

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research