Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A098752
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A098752 a(n+1) = least number > a(n) that begins with the last digit of a(n) and doesn't end with 0. +0
1
1, 11, 12, 21, 101, 102, 201, 1001, 1002, 2001, 10001, 10002, 20001, 100001, 100002, 200001, 1000001, 1000002, 2000001, 10000001, 10000002, 20000001, 100000001, 100000002, 200000001, 1000000001, 1000000002, 2000000001, 10000000001 (list; graph; listen)
OFFSET

1,2

COMMENT

a(n) must be chosen with nonzero rightmost digit.

FORMULA

For n=0 mod 3, a(n) = 10^(n/3) + 2; for n=1 mod 3, n>1, a(n) = 2*10^((n-1)/3) + 1; for n=2 mod 3, a(n) = 10^((n+1)/3) + 1. - Sam Alexander (amnalexander(AT)yahoo.com), Jan 04 2005

CROSSREFS

Cf. A076654.

Cf. A101233.

Sequence in context: A131363 A089185 A098754 this_sequence A084855 A101233 A118512

Adjacent sequences: A098749 A098750 A098751 this_sequence A098753 A098754 A098755

KEYWORD

base,easy,nonn

AUTHOR

Eric Angelini (eric.angelini(AT)kntv.be), Oct 01 2004

EXTENSIONS

More terms from Sam Alexander (amnalexander(AT)yahoo.com), Jan 04 2005

More terms from David Wasserman (dwasserm(AT)earthlink.net), Feb 26 2008

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 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research