Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026367
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026367 a(n) = least k such that s(k) = n, where s = A026366. +0
1
1, 2, 4, 5, 7, 8, 9, 10, 12, 13, 15, 16, 17, 18, 20, 21, 23, 24, 26, 27, 29, 30, 31, 32, 34, 35, 37, 38, 39, 40, 42, 43, 45, 46, 48, 49, 51, 52, 53, 54, 56, 57, 59, 60, 61, 62, 64, 65, 67, 68, 69, 70, 72, 73, 75, 76, 77, 78, 80, 81, 83, 84, 86 (list; graph; listen)
OFFSET

1,2

FORMULA

a(n) = a(n-1)+2 if n is in the set 2A+1, a(n) = a(n-1)+1 if n is not in 2A+1 where 2A+1 = {2a(1)+1,2a(2)+1,2a(3)+1,...} = {3,5,9,11,15,17,19,21,25,27,31,33,...}. a(n) = (1+sqrt(3))/2*n+O(1) For example, a(3) = a(2)+2 = 2+2 = 4 since 3 is in 2A+1. a(10) = a(9)+1 = 12+1 = 13 since 10 is not in 2A+1. - Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 23 2008

CROSSREFS

Sequence in context: A035257 A079726 A047498 this_sequence A039069 A010392 A095042

Adjacent sequences: A026364 A026365 A026366 this_sequence A026368 A026369 A026370

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

page 1

Search completed in 0.002 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 4 12:27 EST 2008. Contains 151280 sequences.


AT&T Labs Research