Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A115299
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A115299
%S A115299 2,4,6,8,10,12,14,16,18,1,2,3,4,5,6,7,8,9,10,2,3,4,5,6,7,8,9,10,11,3,4,
%T A115299 5,6,7,8,9,10,11,12,4,5,6,7,8,9,10,11,12,13,5,6,7,8,9,10,11,12,13,14,6,
%U A115299 7,8,9,10,11,12,13,14,15,7,8,9,10,11,12,13,14,15,16,8,9,10,11,12,13,14
%N A115299 Greatest digit of n + least digit of n. Different from A088133.
%C A115299 a(101) = 1 and A088133(101) = 2, but all previous terms match.
%e A115299 a(1) = 1 + 1 = 2, a(232) = 3 + 2 = 5, a(1889009898) = 9 + 0 = 9.
%Y A115299 Cf. A037904 (greatest-least), A115300 (greatest*least), A088133 (first+last).
%Y A115299 Sequence in context: A074157 A076309 A088133 this_sequence A076312 A061762 
               A136614
%Y A115299 Adjacent sequences: A115296 A115297 A115298 this_sequence A115300 A115301 
               A115302
%K A115299 base,nonn
%O A115299 1,1
%A A115299 Rick L. Shepherd (rshepherd2(AT)hotmail.com), Jan 20 2006

    
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