Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A068628
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A068628 Sequence of nodes pertaining to A068627, which is defined as follows: a(0) = 0, a(n) = a(n-1) + n if n does not divide a(n-1). a(n) = a(n-1) - n if n divides a(n-1). a(n) = n if a(n-1) = 0 0,1,3,0,4,9,15,22,30,39,49,60,48,61,75,60,76,93,111,130,150,171,193,216,192,217,243,216,244,273,303,334,366,399,433,468,432,469,507,468,508,549,591,634,678,723,769,816,768,817,867,816,868,921, numbers occurring twice in the sequence like 60 etc. are called nodes. +0
3
0, 60, 216, 468, 816, 1260 (list; graph; listen)
OFFSET

0,2

CROSSREFS

Sequence in context: A112827 A082529 A126248 this_sequence A075287 A103741 A019285

Adjacent sequences: A068625 A068626 A068627 this_sequence A068629 A068630 A068631

KEYWORD

easy,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Feb 26 2002

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research