Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A005041
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A005041 M0258
%S A005041 1,1,2,2,3,3,4,4,4,5,5,5,6,6,6,7,7,7,7,8,8,8,8,9,9,9,9,10,10,10,10,10,
%T A005041 11,11,11,11,11,12,12,12,12,12,13,13,13,13,13,13,14,14,14,14,14,14,15,
%U A005041 15,15,15,15,15,16,16,16,16,16,16,16,17,17,17,17,17,17,17,18,18,18,18
%N A005041 A self-generating sequence.
%D A005041 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A005041 Problem 1047, Math. Mag., 52 (1979), 265.
%F A005041 For any k in {0, 1, 2, ...} and r in {0, 1, 2), we have: if n=6*k+(3/
               2)*(k)*(k-1)+r*(k+2), then a(n)=3*k+r+1. E.g. for k=3 and r=1, we 
               have n=6*3+(3/2)*(3)*(3-1)+1*(3+2)=32 and so a(32)=3*3+1+1=11. - 
               Francois Jooste (phukraut(AT)hotmail.com), Mar 12 2002
%Y A005041 Cf. A005038 A005039 A005040 A005043 A005044 A055086 A001462 A082462 A024417 
               A084500.
%Y A005041 Sequence in context: A055086 A001462 A082462 this_sequence A030530 A084500 
               A084557
%Y A005041 Adjacent sequences: A005038 A005039 A005040 this_sequence A005042 A005043 
               A005044
%K A005041 nonn,nice,easy
%O A005041 0,3
%A A005041 N. J. A. Sloane (njas(AT)research.att.com), Jeffrey Shallit
%E A005041 More terms from Samuel Hilliard (sam_spade1977(AT)hotmail.com), Apr 11 
               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