The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A064002 List pairs (i,j) with 1 <= i <= j in lexicographic order: (1,1), (1,2), (2,2), (1,3), (2,3), (3,3), (1,4), ... Let a(1) = 1. Then for n>=2 if the (n-1)-st pair is (i,j) then a(n) = a(i) + a(j) + 1. 0
 1, 3, 5, 7, 7, 9, 11, 9, 11, 13, 15, 9, 11, 13, 15, 15, 11, 13, 15, 17, 17, 19, 13, 15, 17, 19, 19, 21, 23, 11, 13, 15, 17, 17, 19, 21, 19, 13, 15, 17, 19, 19, 21, 23, 21, 23, 15, 17, 19, 21, 21, 23, 25, 23, 25, 27, 17, 19, 21, 23, 23, 25, 27, 25, 27, 29, 31, 11, 13, 15, 17, 17 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS All entries are odd. There are A001190(n) occurrences of 2n-1 in this sequence LINKS EXAMPLE a(2) = a(1)+a(1)+1 = 3, a(3) = a(1)+a(2)+1 = 5, a(4) = a(2)+a(2)+1 = 7, a(5) = a(1)+a(3)+1 = 7, ... CROSSREFS Sequence in context: A316852 A307120 A261010 * A195868 A228543 A254764 Adjacent sequences:  A063999 A064000 A064001 * A064003 A064004 A064005 KEYWORD easy,nonn AUTHOR Claude Lenormand (claude.lenormand(AT)free.fr), Sep 14 2001 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 25 08:37 EDT 2020. Contains 334587 sequences. (Running on oeis4.)