Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A051484
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A051484 a(n) is the next natural number (besides 1) which is not congruent to a(i) mod a(j) for any i < j < n. +0
3
0, 2, 3, 7, 13, 19, 25, 43, 61, 109, 139, 151, 181, 187, 229, 295, 337, 487, 505, 517, 565, 571, 643, 655, 685, 823, 883, 901, 985, 1189, 1243, 1279, 1285, 1429, 1441, 1597, 1621, 1639, 1699, 1735, 1741, 1867, 1915, 1933, 2101, 2143, 2155, 2167, 2371 (list; graph; listen)
OFFSET

1,2

COMMENT

All elements from 7 onward seem to be either 1 or 7 modulo 12. - Walter A. Kehowski (wkehowski(AT)cox.net), Oct 08 2005

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000

EXAMPLE

5 is congruent to 2 (mod 3), so 5 cannot be in the sequence. 25 mod 2 (resp. 3, 7, 13, 19) gives 1 (resp. 1, 4, 12, 6), which is not in the sequence.

MAPLE

M:=[0, 2]: for z to 1 do for n from 3 to 5000 do b:=true; for j from 1 to nops(M)-1 do for k from j+1 to nops(M) do if M[j] = n mod M[k] then b:=false; break; fi od od; if b then M:=[op(M), n] fi; od; od; M; (Kehowski)

MATHEMATICA

a[1] = 0; a[2] = 2; a[n_] := a[n] = Block[{k = a[n - 1] + 1, t = a[ # ] & /@ Range[n - 1]}, While[ Intersection[t, Union[ Mod[k, Rest[ t]]]] != {}, k++ ]; k]; Table[ a[n], {n, 50}] (from Robert G. Wilson v (rgwv(at)rgwv.com), Oct 19 2005)

CROSSREFS

Sequence in context: A068828 A100764 A076974 this_sequence A101415 A045331 A053613

Adjacent sequences: A051481 A051482 A051483 this_sequence A051485 A051486 A051487

KEYWORD

easy,nonn,nice

AUTHOR

H. Tracy Hall (hthall(AT)math.berkeley.edu)

EXTENSIONS

What is the asymptotic distribution of these numbers?

More terms from Walter A. Kehowski (wkehowski(AT)cox.net), Oct 08 2005

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 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research