Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A044251
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A044251
%S A044251 81,162,243,324,405,486,567,648,729,810,891,972,1053,1134,1215,
%T A044251 1296,1377,1458,1539,1620,1701,1782,1863,1944,2025,2106,2187,
%U A044251 2268,2349,2430,2511,2592,2673,2754,2835,2916,2997,3078,3159
%N A044251 Numbers n such that string 0,0 occurs in the base 9 representation of 
               n but not of n-1.
%C A044251 Every element is a multiple of 81. The smallest positive multiple of 
               81 not in the sequence is 6642. - David W. Wilson (davidwwilson(AT)comcast.net), 
               Aug 03 2005
%H A044251 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/
               NonRecursions.html">Non Recursions</a>
%Y A044251 Sequence in context: A046374 A153259 A139705 this_sequence A043454 A044632 
               A031494
%Y A044251 Adjacent sequences: A044248 A044249 A044250 this_sequence A044252 A044253 
               A044254
%K A044251 nonn,base
%O A044251 1,1
%A A044251 Clark Kimberling (ck6(AT)evansville.edu)

    
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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research