Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A131485
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A131485 Smallest positive integer k == n mod 3 not occurring earlier such that the sum of two successive terms is a square-free number. +0
1
1, 2, 3, 4, 11, 6, 7, 8, 9, 10, 5, 12, 19, 14, 15, 22, 17, 18, 19, 20, 21, 16, 23, 24, 31, 20, 27, 28, 29, 30 (list; graph; listen)
OFFSET

1,2

COMMENT

Mod 3 analogue of A077223. A permutation of the natural numbers. There's an obvious limit to the number of successive values which can be consecutive integers.

FORMULA

a(n) = MIN{k > 0 such that 3|(n-k) and k + a(n-1) not in A005117}. a(n) = MIN{k > 0 such that 3|(n-k) and k + a(n-1) in A013929}.

CROSSREFS

Cf. A005117, A013929, A077223.

Sequence in context: A035358 A065633 A160652 this_sequence A075833 A117351 A108467

Adjacent sequences: A131482 A131483 A131484 this_sequence A131486 A131487 A131488

KEYWORD

easy,nonn

AUTHOR

Jonathan Vos Post (jvospost3(AT)gmail.com), Oct 01 2007

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 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research