Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026858
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A026858
%S A026858 4,3,3,3,7,6,3,5,4,4,5,6,6,7,11,8,6,11,8,10,5,7,8,8,12,11,8,10,8,9,6,8,
%T A026858 9,9,13,12,9,11,9,10,8,10,11,11,15,14,11,13,11,12,9,11,12,12,16,15,12,
%U A026858 14,12,13,8,10,11,11,15,14,11,13,11,12,8,10,11,11,15,14,11,13,11,12,7,
               9
%N A026858 Number of letters in n (in Italian).
%H A026858 <a href="Sindx_Lc.html#letters">Index entries for sequences related to 
               number of letters in n</a>
%Y A026858 A005589.
%Y A026858 Sequence in context: A031353 A085415 A059124 this_sequence A129344 A048853 
               A011762
%Y A026858 Adjacent sequences: A026855 A026856 A026857 this_sequence A026859 A026860 
               A026861
%K A026858 nonn,word,easy
%O A026858 1,1
%A A026858 Alberto Maretti (alberto(AT)dis.uniroma1.it), Aug 03 2000
%E A026858 Corrected and extended by Marco Broglia (broglia(AT)fastwebnet.it), Oct 
               01 2008

    
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 December 6 22:55 EST 2009. Contains 170429 sequences.


AT&T Labs Research