Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A158233
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A158233 A120070(n+1)*A120070(n+2) mod 9. +0
1
6, 4, 3, 0, 3, 6, 0, 3, 0, 0, 4, 0, 0, 4, 6, 0, 0, 6, 0, 6, 0, 0, 6, 3, 0, 3, 6, 3, 4, 0, 0, 4, 0, 0, 4, 0, 0, 6, 3, 0, 3, 6, 0, 0, 3, 0, 0, 6, 0, 6, 0, 0, 3, 3, 6, 4, 0, 0, 4, 0, 0, 4, 0, 0, 4, 3, 0, 3, 0, 0, 0, 3, 0, 6, 6, 0, 3, 6, 0, 3, 0, 0, 0, 3, 0, 6, 6, 0, 3, 0, 0, 4, 0, 0, 4, 0, 0, 4, 0, 0, 4, 0, 0, 4, 6 (list; graph; listen)
OFFSET

1,1

COMMENT

Conjecture: this contains only the numbers 0,3,4,6 (verified for the first 5000 terms).

This multiply-modulo transformation is also used in the unrelated A157742, A158012, A158068, A158090.

MAPLE

A120070 := proc(m, n) if m-1 >= n then m^2-n^2; else 0; fi; end:

A120070flat := proc(n) i := 2 ; for m from 2 do for l from 1 to m-1 do if i = n then RETURN(A120070(m, l)) ; else i := i+1 ; fi; od: od: end:

A158233 := proc(n) (A120070flat(n+1)*A120070flat(n+2) ) mod 9 ; end: seq(A158233(n), n=1..180) ; # R. J. Mathar, Apr 09 2009

CROSSREFS

Sequence in context: A086036 A019849 A118421 this_sequence A093604 A011408 A157296

Adjacent sequences: A158230 A158231 A158232 this_sequence A158234 A158235 A158236

KEYWORD

nonn

AUTHOR

Paul Curtz (bpcrtz(AT)free.fr), Mar 14 2009

EXTENSIONS

Edited and extended by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 09 2009

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research