Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A095115
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A095115 a(1)=1. Given a(1),...,a(n-1), let S = {a(1), ..., a(n-1), |a(2)-a(1)|, ..., |a(n-1)-a(n-2)|}. Let d be the smallest positive integer not in S. Then a(n) is the smallest one of a(n-1)-d and a(n-1)+d which is a positive integer not in S union {d}. +0
1
1, 3, 7, 12, 18, 10, 19, 30, 17, 31, 16, 36, 57, 35, 58, 34, 59, 33, 60, 32, 61, 98, 136, 97, 137, 96, 54 (list; graph; listen)
OFFSET

1,2

LINKS

Leroy Quet, Home Page (listed in lieu of email address)

EXAMPLE

For n=5, S={1,3,7,12, 2,4,5} so d=6. a(4)-d=6 is in S union {6}, so we have a(5)=a(4)+d=18.

a(28) does not exist: d=43, but both a(28)-43=11 and a(28)+43=97 are in S union {43}.

MATHEMATICA

mex1[s_]:=Module[{n}, For[n=1, MemberQ[s, n], n++, Null]; n]; a[1]=1; a[n_]:=a[n]=Module[{as, d}, as=a/@Range[n-1]; as=Union[as, Abs[Drop[as, 1]-Drop[as, -1]]]; AppendTo[as, d=mex1[as]]; If[a[n-1]-d>0&&!MemberQ[as, a[n-1]-d], a[n-1]-d, If[ !MemberQ[as, a[n-1]+d], a[n-1]+d], False]]

CROSSREFS

Adjacent sequences: A095112 A095113 A095114 this_sequence A095116 A095117 A095118

Sequence in context: A084582 A072098 A140778 this_sequence A141214 A027379 A055998

KEYWORD

nonn,fini,full

AUTHOR

Dean Hickerson (dean.hickerson(AT)yahoo.com), following a suggestion of Leroy Quet May 28 2004

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 November 7 16:45 EST 2009. Contains 166093 sequences.


AT&T Labs Research