Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A098608
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A098608
%S A098608 1,100,10000,1000000,100000000,10000000000,1000000000000,
%T A098608 100000000000000,10000000000000000,1000000000000000000,
%U A098608 100000000000000000000,10000000000000000000000
%N A098608 100^n.
%C A098608 For any base B, these are the numbers (B^2)^n written in base B. - Philippe 
               DELEHAM (kolotoko(AT)wanadoo.fr), Jan 06 2008
%H A098608 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/
               RecursiveSequences.html">Recursive Sequences</a>
%F A098608 a(n) =100*a(n-1) =A011557(2n) =A098609(n)+1. G.f.: 1/(1-100x).
%Y A098608 Sequence in context: A077440 A029794 A029801 this_sequence A045799 A096885 
               A027576
%Y A098608 Adjacent sequences: A098605 A098606 A098607 this_sequence A098609 A098610 
               A098611
%K A098608 easy,nonn
%O A098608 0,2
%A A098608 Henry Bottomley (se16(AT)btinternet.com), Sep 17 2004

    
page 1

Search completed in 0.001 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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research