Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A062886
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A062886 Smallest multiple of 2n+1 with property that digits are odd and each digit is two more (mod 10) than the previous digit; or 0 if no such number exists. +0
1
1, 3, 5, 7, 9, 913, 91, 135, 357, 57, 357, 1357, 0, 135, 9135, 91357 (list; graph; listen)
OFFSET

0,2

EXAMPLE

a(7) = 91 = 13*7 has increasing odd digits.

a[12] does not exist because a number in base 10 divisible by 25 ends with 00,25,50 or 75, so a[12]=0.

CROSSREFS

A062884, A062885.

Sequence in context: A030148 A068061 A062887 this_sequence A133452 A140607 A071561

Adjacent sequences: A062883 A062884 A062885 this_sequence A062887 A062888 A062889

KEYWORD

nonn,base,easy

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 28 2001

EXTENSIONS

More terms from Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Mar 23 2002

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 7 23:50 EST 2009. Contains 170430 sequences.


AT&T Labs Research